./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a86740b4b3d791346dd5ab0675f134d34312247f7633c0f06bf117457d4ce2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:57:29,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:29,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:29,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:29,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:29,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:29,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:29,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:29,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:29,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:29,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:29,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:29,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:29,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:29,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:29,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:29,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:29,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:29,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:29,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:29,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:29,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:29,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:29,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:29,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:29,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:29,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:29,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:29,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:29,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:29,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:29,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:29,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:29,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:29,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:29,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:29,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:29,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:29,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:29,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:29,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:29,378 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:57:29,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:29,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:29,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:29,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:29,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:29,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:29,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:29,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:29,422 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:29,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:29,424 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:29,424 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:57:29,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:29,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:29,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:29,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:29,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:29,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:29,426 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:57:29,426 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:29,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:29,426 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:29,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:29,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:29,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:29,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:29,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:29,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:29,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:29,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:29,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:29,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:29,431 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:29,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:29,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:29,432 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_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44a86740b4b3d791346dd5ab0675f134d34312247f7633c0f06bf117457d4ce2 [2022-11-02 20:57:29,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:29,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:29,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:29,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:29,783 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:29,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2022-11-02 20:57:29,869 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/data/eb0bb9f6a/cd8cf8869d0a4a5eb0d1d41488a40447/FLAG2a427c476 [2022-11-02 20:57:30,398 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:30,398 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2022-11-02 20:57:30,407 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/data/eb0bb9f6a/cd8cf8869d0a4a5eb0d1d41488a40447/FLAG2a427c476 [2022-11-02 20:57:30,752 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/data/eb0bb9f6a/cd8cf8869d0a4a5eb0d1d41488a40447 [2022-11-02 20:57:30,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:30,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:30,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:30,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:30,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:30,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:30" (1/1) ... [2022-11-02 20:57:30,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db2df45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:30, skipping insertion in model container [2022-11-02 20:57:30,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:30" (1/1) ... [2022-11-02 20:57:30,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:30,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:30,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3481,3494] [2022-11-02 20:57:30,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:31,004 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:31,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3481,3494] [2022-11-02 20:57:31,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:31,061 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:31,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31 WrapperNode [2022-11-02 20:57:31,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:31,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:31,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:31,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:31,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,126 INFO L138 Inliner]: procedures = 23, calls = 45, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 558 [2022-11-02 20:57:31,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:31,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:31,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:31,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:31,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,165 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:31,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:31,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:31,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:31,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (1/1) ... [2022-11-02 20:57:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:31,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:31,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:31,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:57:31,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:57:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:57:31,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:57:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:57:31,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:57:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:57:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:57:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:57:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:31,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:57:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:31,297 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:57:31,487 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:31,490 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:32,422 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:33,494 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:33,494 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:57:33,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:33 BoogieIcfgContainer [2022-11-02 20:57:33,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:33,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:33,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:33,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:33,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:30" (1/3) ... [2022-11-02 20:57:33,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12987c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:33, skipping insertion in model container [2022-11-02 20:57:33,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:31" (2/3) ... [2022-11-02 20:57:33,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12987c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:33, skipping insertion in model container [2022-11-02 20:57:33,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:33" (3/3) ... [2022-11-02 20:57:33,506 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2022-11-02 20:57:33,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:57:33,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:33,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-02 20:57:33,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:57:33,677 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:57:33,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 275 transitions, 574 flow [2022-11-02 20:57:33,850 INFO L130 PetriNetUnfolder]: 3/272 cut-off events. [2022-11-02 20:57:33,850 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:57:33,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 272 events. 3/272 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 417 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-02 20:57:33,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 275 transitions, 574 flow [2022-11-02 20:57:33,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 248 transitions, 514 flow [2022-11-02 20:57:33,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:33,897 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;@35a3d84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:33,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 129 error locations. [2022-11-02 20:57:33,906 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-11-02 20:57:33,906 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:33,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:33,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:33,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 64774575, now seen corresponding path program 1 times [2022-11-02 20:57:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:33,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760193806] [2022-11-02 20:57:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760193806] [2022-11-02 20:57:34,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760193806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:34,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:34,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647675919] [2022-11-02 20:57:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:34,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:34,313 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:34,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 248 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:34,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:34,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:34,538 INFO L130 PetriNetUnfolder]: 16/244 cut-off events. [2022-11-02 20:57:34,538 INFO L131 PetriNetUnfolder]: For 34/41 co-relation queries the response was YES. [2022-11-02 20:57:34,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 244 events. 16/244 cut-off events. For 34/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 247 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 173. Up to 40 conditions per place. [2022-11-02 20:57:34,542 INFO L137 encePairwiseOnDemand]: 218/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2022-11-02 20:57:34,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 193 transitions, 432 flow [2022-11-02 20:57:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2022-11-02 20:57:34,564 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8254545454545454 [2022-11-02 20:57:34,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 681 transitions. [2022-11-02 20:57:34,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 681 transitions. [2022-11-02 20:57:34,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:34,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 681 transitions. [2022-11-02 20:57:34,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,590 INFO L175 Difference]: Start difference. First operand has 257 places, 248 transitions, 514 flow. Second operand 3 states and 681 transitions. [2022-11-02 20:57:34,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 193 transitions, 432 flow [2022-11-02 20:57:34,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:57:34,609 INFO L231 Difference]: Finished difference. Result has 198 places, 193 transitions, 396 flow [2022-11-02 20:57:34,611 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=198, PETRI_TRANSITIONS=193} [2022-11-02 20:57:34,615 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2022-11-02 20:57:34,615 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 193 transitions, 396 flow [2022-11-02 20:57:34,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:34,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:34,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:34,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1743255454, now seen corresponding path program 1 times [2022-11-02 20:57:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:34,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428757665] [2022-11-02 20:57:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:34,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:34,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428757665] [2022-11-02 20:57:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428757665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:34,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038739655] [2022-11-02 20:57:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:34,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:34,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:34,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:34,748 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:34,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 193 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:34,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:34,914 INFO L130 PetriNetUnfolder]: 16/243 cut-off events. [2022-11-02 20:57:34,914 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:34,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 243 events. 16/243 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 253. Up to 40 conditions per place. [2022-11-02 20:57:34,916 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2022-11-02 20:57:34,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 192 transitions, 422 flow [2022-11-02 20:57:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:34,919 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:34,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:34,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:34,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:34,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:34,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,925 INFO L175 Difference]: Start difference. First operand has 198 places, 193 transitions, 396 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 192 transitions, 422 flow [2022-11-02 20:57:34,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 192 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:34,930 INFO L231 Difference]: Finished difference. Result has 197 places, 192 transitions, 394 flow [2022-11-02 20:57:34,930 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=197, PETRI_TRANSITIONS=192} [2022-11-02 20:57:34,931 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -60 predicate places. [2022-11-02 20:57:34,931 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 192 transitions, 394 flow [2022-11-02 20:57:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:34,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:34,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:34,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:34,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1850007517, now seen corresponding path program 1 times [2022-11-02 20:57:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:34,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461609425] [2022-11-02 20:57:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:35,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461609425] [2022-11-02 20:57:35,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461609425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:35,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:35,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944601578] [2022-11-02 20:57:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:35,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:35,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:35,042 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:35,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 192 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:35,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:35,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:35,153 INFO L130 PetriNetUnfolder]: 16/242 cut-off events. [2022-11-02 20:57:35,153 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 242 events. 16/242 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 245. Up to 40 conditions per place. [2022-11-02 20:57:35,156 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2022-11-02 20:57:35,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 191 transitions, 420 flow [2022-11-02 20:57:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:35,160 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:35,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:35,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,166 INFO L175 Difference]: Start difference. First operand has 197 places, 192 transitions, 394 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:35,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 191 transitions, 420 flow [2022-11-02 20:57:35,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 191 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:35,170 INFO L231 Difference]: Finished difference. Result has 196 places, 191 transitions, 392 flow [2022-11-02 20:57:35,171 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=196, PETRI_TRANSITIONS=191} [2022-11-02 20:57:35,173 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -61 predicate places. [2022-11-02 20:57:35,174 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 191 transitions, 392 flow [2022-11-02 20:57:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:35,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:35,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1097061295, now seen corresponding path program 1 times [2022-11-02 20:57:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425675944] [2022-11-02 20:57:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425675944] [2022-11-02 20:57:35,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425675944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:35,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:35,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066440858] [2022-11-02 20:57:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:35,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:35,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:35,275 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:35,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 191 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:35,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:35,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:35,404 INFO L130 PetriNetUnfolder]: 16/241 cut-off events. [2022-11-02 20:57:35,405 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:35,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 241 events. 16/241 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 237. Up to 40 conditions per place. [2022-11-02 20:57:35,408 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-02 20:57:35,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 190 transitions, 418 flow [2022-11-02 20:57:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:35,412 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:35,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:35,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,423 INFO L175 Difference]: Start difference. First operand has 196 places, 191 transitions, 392 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:35,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 190 transitions, 418 flow [2022-11-02 20:57:35,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 190 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:35,434 INFO L231 Difference]: Finished difference. Result has 195 places, 190 transitions, 390 flow [2022-11-02 20:57:35,435 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=195, PETRI_TRANSITIONS=190} [2022-11-02 20:57:35,436 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -62 predicate places. [2022-11-02 20:57:35,437 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 190 transitions, 390 flow [2022-11-02 20:57:35,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:35,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:35,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1866132514, now seen corresponding path program 1 times [2022-11-02 20:57:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294044389] [2022-11-02 20:57:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294044389] [2022-11-02 20:57:35,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294044389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:35,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:35,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616445984] [2022-11-02 20:57:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:35,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:35,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:35,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:35,547 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:35,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 190 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:35,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:35,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:35,678 INFO L130 PetriNetUnfolder]: 16/240 cut-off events. [2022-11-02 20:57:35,678 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:35,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 240 events. 16/240 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 242 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 229. Up to 40 conditions per place. [2022-11-02 20:57:35,679 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2022-11-02 20:57:35,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 189 transitions, 416 flow [2022-11-02 20:57:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:35,682 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:35,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:35,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,689 INFO L175 Difference]: Start difference. First operand has 195 places, 190 transitions, 390 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:35,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 189 transitions, 416 flow [2022-11-02 20:57:35,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 189 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:35,695 INFO L231 Difference]: Finished difference. Result has 194 places, 189 transitions, 388 flow [2022-11-02 20:57:35,695 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=194, PETRI_TRANSITIONS=189} [2022-11-02 20:57:35,698 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -63 predicate places. [2022-11-02 20:57:35,698 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 189 transitions, 388 flow [2022-11-02 20:57:35,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:35,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:35,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 857928664, now seen corresponding path program 1 times [2022-11-02 20:57:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82664106] [2022-11-02 20:57:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82664106] [2022-11-02 20:57:35,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82664106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:35,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984695342] [2022-11-02 20:57:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:35,812 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:35,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 189 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:35,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:35,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:35,933 INFO L130 PetriNetUnfolder]: 16/239 cut-off events. [2022-11-02 20:57:35,933 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 239 events. 16/239 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 234 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 221. Up to 40 conditions per place. [2022-11-02 20:57:35,935 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2022-11-02 20:57:35,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 414 flow [2022-11-02 20:57:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:35,937 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:35,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:35,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:35,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,943 INFO L175 Difference]: Start difference. First operand has 194 places, 189 transitions, 388 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:35,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 414 flow [2022-11-02 20:57:35,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 188 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:35,947 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 386 flow [2022-11-02 20:57:35,947 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2022-11-02 20:57:35,950 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -64 predicate places. [2022-11-02 20:57:35,950 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 386 flow [2022-11-02 20:57:35,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:35,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:35,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:57:35,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,952 INFO L85 PathProgramCache]: Analyzing trace with hash 624269187, now seen corresponding path program 1 times [2022-11-02 20:57:35,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019316436] [2022-11-02 20:57:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:36,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019316436] [2022-11-02 20:57:36,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019316436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:36,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:36,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667086212] [2022-11-02 20:57:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:36,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:36,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:36,008 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:36,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:36,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:36,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:36,103 INFO L130 PetriNetUnfolder]: 16/238 cut-off events. [2022-11-02 20:57:36,104 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:36,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 238 events. 16/238 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 213. Up to 40 conditions per place. [2022-11-02 20:57:36,105 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2022-11-02 20:57:36,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 187 transitions, 412 flow [2022-11-02 20:57:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:36,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:36,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:36,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,113 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 386 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:36,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 187 transitions, 412 flow [2022-11-02 20:57:36,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 187 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:36,117 INFO L231 Difference]: Finished difference. Result has 192 places, 187 transitions, 384 flow [2022-11-02 20:57:36,118 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=192, PETRI_TRANSITIONS=187} [2022-11-02 20:57:36,119 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -65 predicate places. [2022-11-02 20:57:36,119 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 187 transitions, 384 flow [2022-11-02 20:57:36,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:36,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:36,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:36,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1234529450, now seen corresponding path program 1 times [2022-11-02 20:57:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:36,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632772167] [2022-11-02 20:57:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:36,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:36,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632772167] [2022-11-02 20:57:36,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632772167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:36,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:36,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366347849] [2022-11-02 20:57:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:36,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:36,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:36,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:36,169 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:36,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:36,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:36,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:36,269 INFO L130 PetriNetUnfolder]: 16/237 cut-off events. [2022-11-02 20:57:36,269 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:36,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 237 events. 16/237 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 230 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 205. Up to 40 conditions per place. [2022-11-02 20:57:36,271 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2022-11-02 20:57:36,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 186 transitions, 410 flow [2022-11-02 20:57:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:36,273 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:36,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:36,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,279 INFO L175 Difference]: Start difference. First operand has 192 places, 187 transitions, 384 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:36,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 186 transitions, 410 flow [2022-11-02 20:57:36,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 186 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:36,284 INFO L231 Difference]: Finished difference. Result has 191 places, 186 transitions, 382 flow [2022-11-02 20:57:36,284 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=191, PETRI_TRANSITIONS=186} [2022-11-02 20:57:36,285 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -66 predicate places. [2022-11-02 20:57:36,285 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 186 transitions, 382 flow [2022-11-02 20:57:36,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:36,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:36,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:57:36,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1851739378, now seen corresponding path program 1 times [2022-11-02 20:57:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:36,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710303605] [2022-11-02 20:57:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710303605] [2022-11-02 20:57:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710303605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:36,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:36,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797039411] [2022-11-02 20:57:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:36,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:36,336 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:36,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 186 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:36,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:36,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:36,428 INFO L130 PetriNetUnfolder]: 16/236 cut-off events. [2022-11-02 20:57:36,429 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:36,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 236 events. 16/236 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 233 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 197. Up to 40 conditions per place. [2022-11-02 20:57:36,430 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2022-11-02 20:57:36,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 185 transitions, 408 flow [2022-11-02 20:57:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:36,433 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:36,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:36,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,439 INFO L175 Difference]: Start difference. First operand has 191 places, 186 transitions, 382 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:36,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 185 transitions, 408 flow [2022-11-02 20:57:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 185 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:36,443 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 380 flow [2022-11-02 20:57:36,444 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2022-11-02 20:57:36,445 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -67 predicate places. [2022-11-02 20:57:36,445 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 380 flow [2022-11-02 20:57:36,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:36,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:36,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:57:36,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash -405661687, now seen corresponding path program 1 times [2022-11-02 20:57:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:36,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990664063] [2022-11-02 20:57:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990664063] [2022-11-02 20:57:36,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990664063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:36,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:36,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924032334] [2022-11-02 20:57:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:36,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:36,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:36,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:36,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:36,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:36,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:36,632 INFO L130 PetriNetUnfolder]: 16/235 cut-off events. [2022-11-02 20:57:36,632 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:36,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 235 events. 16/235 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 227 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 189. Up to 40 conditions per place. [2022-11-02 20:57:36,634 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2022-11-02 20:57:36,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 184 transitions, 406 flow [2022-11-02 20:57:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:36,636 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:36,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:36,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,641 INFO L175 Difference]: Start difference. First operand has 190 places, 185 transitions, 380 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:36,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 184 transitions, 406 flow [2022-11-02 20:57:36,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 184 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:36,645 INFO L231 Difference]: Finished difference. Result has 189 places, 184 transitions, 378 flow [2022-11-02 20:57:36,646 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=189, PETRI_TRANSITIONS=184} [2022-11-02 20:57:36,646 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -68 predicate places. [2022-11-02 20:57:36,646 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 184 transitions, 378 flow [2022-11-02 20:57:36,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:36,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:36,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:57:36,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1762364813, now seen corresponding path program 1 times [2022-11-02 20:57:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:36,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741648447] [2022-11-02 20:57:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741648447] [2022-11-02 20:57:36,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741648447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:36,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:36,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:36,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721482886] [2022-11-02 20:57:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:36,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:36,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:36,696 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:36,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 184 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:36,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:36,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:36,788 INFO L130 PetriNetUnfolder]: 16/234 cut-off events. [2022-11-02 20:57:36,788 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:36,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 234 events. 16/234 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 227 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 181. Up to 40 conditions per place. [2022-11-02 20:57:36,789 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2022-11-02 20:57:36,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 183 transitions, 404 flow [2022-11-02 20:57:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:36,792 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:36,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:36,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,797 INFO L175 Difference]: Start difference. First operand has 189 places, 184 transitions, 378 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:36,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 183 transitions, 404 flow [2022-11-02 20:57:36,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 183 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:36,802 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 376 flow [2022-11-02 20:57:36,802 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2022-11-02 20:57:36,803 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -69 predicate places. [2022-11-02 20:57:36,803 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 376 flow [2022-11-02 20:57:36,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:36,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:36,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:57:36,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 702432143, now seen corresponding path program 1 times [2022-11-02 20:57:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:36,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308910794] [2022-11-02 20:57:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:36,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308910794] [2022-11-02 20:57:36,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308910794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:36,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:36,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511477496] [2022-11-02 20:57:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:36,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:36,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:36,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:36,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:36,852 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 275 [2022-11-02 20:57:36,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:36,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 275 [2022-11-02 20:57:36,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:36,938 INFO L130 PetriNetUnfolder]: 16/233 cut-off events. [2022-11-02 20:57:36,938 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:36,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 233 events. 16/233 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 225 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 173. Up to 40 conditions per place. [2022-11-02 20:57:36,940 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2022-11-02 20:57:36,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 182 transitions, 402 flow [2022-11-02 20:57:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-11-02 20:57:36,942 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76 [2022-11-02 20:57:36,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:36,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-11-02 20:57:36,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,947 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 376 flow. Second operand 3 states and 627 transitions. [2022-11-02 20:57:36,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 182 transitions, 402 flow [2022-11-02 20:57:36,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 182 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:36,951 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 374 flow [2022-11-02 20:57:36,951 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2022-11-02 20:57:36,952 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -70 predicate places. [2022-11-02 20:57:36,952 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 374 flow [2022-11-02 20:57:36,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:36,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:36,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:36,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:57:36,953 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:36,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1485471527, now seen corresponding path program 1 times [2022-11-02 20:57:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:36,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534377245] [2022-11-02 20:57:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534377245] [2022-11-02 20:57:37,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534377245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:37,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:37,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464927112] [2022-11-02 20:57:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:37,500 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 275 [2022-11-02 20:57:37,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:37,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:37,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 275 [2022-11-02 20:57:37,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:37,943 INFO L130 PetriNetUnfolder]: 118/414 cut-off events. [2022-11-02 20:57:37,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 414 events. 118/414 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 817 event pairs, 22 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 530. Up to 118 conditions per place. [2022-11-02 20:57:37,946 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 38 selfloop transitions, 4 changer transitions 0/193 dead transitions. [2022-11-02 20:57:37,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 480 flow [2022-11-02 20:57:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:57:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1159 transitions. [2022-11-02 20:57:37,949 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7024242424242424 [2022-11-02 20:57:37,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1159 transitions. [2022-11-02 20:57:37,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1159 transitions. [2022-11-02 20:57:37,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:37,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1159 transitions. [2022-11-02 20:57:37,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:37,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:37,958 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:37,958 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 374 flow. Second operand 6 states and 1159 transitions. [2022-11-02 20:57:37,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 480 flow [2022-11-02 20:57:37,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:37,962 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 376 flow [2022-11-02 20:57:37,963 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2022-11-02 20:57:37,963 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -68 predicate places. [2022-11-02 20:57:37,964 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 376 flow [2022-11-02 20:57:37,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:37,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:37,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:37,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:57:37,965 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash -792768382, now seen corresponding path program 1 times [2022-11-02 20:57:37,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:37,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452574129] [2022-11-02 20:57:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:37,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:38,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452574129] [2022-11-02 20:57:38,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452574129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:38,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:38,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731547885] [2022-11-02 20:57:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:38,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:38,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:38,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:38,621 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 275 [2022-11-02 20:57:38,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:38,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:38,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 275 [2022-11-02 20:57:38,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:38,971 INFO L130 PetriNetUnfolder]: 107/397 cut-off events. [2022-11-02 20:57:38,971 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:57:38,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 397 events. 107/397 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 727 event pairs, 79 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 220. Up to 146 conditions per place. [2022-11-02 20:57:38,973 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 33 selfloop transitions, 4 changer transitions 0/188 dead transitions. [2022-11-02 20:57:38,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 188 transitions, 464 flow [2022-11-02 20:57:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:57:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1154 transitions. [2022-11-02 20:57:38,977 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6993939393939393 [2022-11-02 20:57:38,977 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1154 transitions. [2022-11-02 20:57:38,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1154 transitions. [2022-11-02 20:57:38,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:38,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1154 transitions. [2022-11-02 20:57:38,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:38,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:38,985 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:38,985 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 376 flow. Second operand 6 states and 1154 transitions. [2022-11-02 20:57:38,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 188 transitions, 464 flow [2022-11-02 20:57:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 188 transitions, 457 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:57:38,990 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 375 flow [2022-11-02 20:57:38,990 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2022-11-02 20:57:38,992 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -68 predicate places. [2022-11-02 20:57:38,992 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 375 flow [2022-11-02 20:57:38,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:38,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:38,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:38,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:57:38,993 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:38,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1755894611, now seen corresponding path program 1 times [2022-11-02 20:57:38,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:38,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404234315] [2022-11-02 20:57:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:38,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:39,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:39,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404234315] [2022-11-02 20:57:39,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404234315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:39,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:39,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:39,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130451153] [2022-11-02 20:57:39,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:39,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:39,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:39,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:39,882 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 275 [2022-11-02 20:57:39,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:39,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:39,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 275 [2022-11-02 20:57:39,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:40,269 INFO L130 PetriNetUnfolder]: 106/395 cut-off events. [2022-11-02 20:57:40,270 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:57:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 395 events. 106/395 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 727 event pairs, 100 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 473. Up to 189 conditions per place. [2022-11-02 20:57:40,272 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 28 selfloop transitions, 4 changer transitions 0/183 dead transitions. [2022-11-02 20:57:40,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 183 transitions, 445 flow [2022-11-02 20:57:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:57:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2022-11-02 20:57:40,276 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6963636363636364 [2022-11-02 20:57:40,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1149 transitions. [2022-11-02 20:57:40,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1149 transitions. [2022-11-02 20:57:40,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:40,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1149 transitions. [2022-11-02 20:57:40,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,300 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,300 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 375 flow. Second operand 6 states and 1149 transitions. [2022-11-02 20:57:40,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 183 transitions, 445 flow [2022-11-02 20:57:40,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 183 transitions, 438 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:57:40,306 INFO L231 Difference]: Finished difference. Result has 189 places, 179 transitions, 374 flow [2022-11-02 20:57:40,307 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=189, PETRI_TRANSITIONS=179} [2022-11-02 20:57:40,307 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -68 predicate places. [2022-11-02 20:57:40,308 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 179 transitions, 374 flow [2022-11-02 20:57:40,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:40,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:40,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:57:40,309 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1124541950, now seen corresponding path program 1 times [2022-11-02 20:57:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:40,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971554947] [2022-11-02 20:57:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:40,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971554947] [2022-11-02 20:57:40,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971554947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:40,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:40,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576566089] [2022-11-02 20:57:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:40,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:40,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:40,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:40,497 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 275 [2022-11-02 20:57:40,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 179 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:40,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 275 [2022-11-02 20:57:40,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:40,608 INFO L130 PetriNetUnfolder]: 16/229 cut-off events. [2022-11-02 20:57:40,609 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:40,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 229 events. 16/229 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 221 event pairs, 15 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 253. Up to 37 conditions per place. [2022-11-02 20:57:40,610 INFO L137 encePairwiseOnDemand]: 273/275 looper letters, 10 selfloop transitions, 1 changer transitions 0/178 dead transitions. [2022-11-02 20:57:40,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 178 transitions, 394 flow [2022-11-02 20:57:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-11-02 20:57:40,614 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7672727272727272 [2022-11-02 20:57:40,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2022-11-02 20:57:40,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2022-11-02 20:57:40,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:40,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2022-11-02 20:57:40,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,621 INFO L175 Difference]: Start difference. First operand has 189 places, 179 transitions, 374 flow. Second operand 3 states and 633 transitions. [2022-11-02 20:57:40,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 178 transitions, 394 flow [2022-11-02 20:57:40,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 178 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:57:40,626 INFO L231 Difference]: Finished difference. Result has 186 places, 178 transitions, 367 flow [2022-11-02 20:57:40,627 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=186, PETRI_TRANSITIONS=178} [2022-11-02 20:57:40,627 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -71 predicate places. [2022-11-02 20:57:40,628 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 178 transitions, 367 flow [2022-11-02 20:57:40,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:40,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:40,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:57:40,630 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1458804463, now seen corresponding path program 1 times [2022-11-02 20:57:40,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:40,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070201636] [2022-11-02 20:57:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:40,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070201636] [2022-11-02 20:57:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070201636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:40,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022050457] [2022-11-02 20:57:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:40,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:40,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:40,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:40,815 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 275 [2022-11-02 20:57:40,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 178 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:40,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 275 [2022-11-02 20:57:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:40,900 INFO L130 PetriNetUnfolder]: 15/232 cut-off events. [2022-11-02 20:57:40,900 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:40,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 232 events. 15/232 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 222 event pairs, 15 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 262. Up to 37 conditions per place. [2022-11-02 20:57:40,902 INFO L137 encePairwiseOnDemand]: 273/275 looper letters, 10 selfloop transitions, 1 changer transitions 0/177 dead transitions. [2022-11-02 20:57:40,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 177 transitions, 387 flow [2022-11-02 20:57:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-11-02 20:57:40,906 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7672727272727272 [2022-11-02 20:57:40,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2022-11-02 20:57:40,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2022-11-02 20:57:40,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:40,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2022-11-02 20:57:40,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,911 INFO L175 Difference]: Start difference. First operand has 186 places, 178 transitions, 367 flow. Second operand 3 states and 633 transitions. [2022-11-02 20:57:40,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 177 transitions, 387 flow [2022-11-02 20:57:40,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 177 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:57:40,916 INFO L231 Difference]: Finished difference. Result has 186 places, 177 transitions, 366 flow [2022-11-02 20:57:40,916 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2022-11-02 20:57:40,917 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -71 predicate places. [2022-11-02 20:57:40,917 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 366 flow [2022-11-02 20:57:40,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:40,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:57:40,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:57:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1749319233, now seen corresponding path program 1 times [2022-11-02 20:57:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:40,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724076522] [2022-11-02 20:57:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:41,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724076522] [2022-11-02 20:57:41,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724076522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:41,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:41,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085268288] [2022-11-02 20:57:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,108 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 275 [2022-11-02 20:57:41,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:41,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 275 [2022-11-02 20:57:41,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:41,189 INFO L130 PetriNetUnfolder]: 15/230 cut-off events. [2022-11-02 20:57:41,189 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 20:57:41,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 230 events. 15/230 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 219 event pairs, 15 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 272. Up to 37 conditions per place. [2022-11-02 20:57:41,190 INFO L137 encePairwiseOnDemand]: 273/275 looper letters, 0 selfloop transitions, 0 changer transitions 176/176 dead transitions. [2022-11-02 20:57:41,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 176 transitions, 384 flow [2022-11-02 20:57:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2022-11-02 20:57:41,193 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7660606060606061 [2022-11-02 20:57:41,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2022-11-02 20:57:41,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2022-11-02 20:57:41,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:41,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2022-11-02 20:57:41,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,197 INFO L175 Difference]: Start difference. First operand has 186 places, 177 transitions, 366 flow. Second operand 3 states and 632 transitions. [2022-11-02 20:57:41,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 176 transitions, 384 flow [2022-11-02 20:57:41,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 176 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:57:41,200 INFO L231 Difference]: Finished difference. Result has 186 places, 0 transitions, 0 flow [2022-11-02 20:57:41,200 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=186, PETRI_TRANSITIONS=0} [2022-11-02 20:57:41,201 INFO L287 CegarLoopForPetriNet]: 257 programPoint places, -71 predicate places. [2022-11-02 20:57:41,201 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 0 transitions, 0 flow [2022-11-02 20:57:41,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (128 of 129 remaining) [2022-11-02 20:57:41,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 129 remaining) [2022-11-02 20:57:41,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (126 of 129 remaining) [2022-11-02 20:57:41,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (125 of 129 remaining) [2022-11-02 20:57:41,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (124 of 129 remaining) [2022-11-02 20:57:41,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (123 of 129 remaining) [2022-11-02 20:57:41,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (122 of 129 remaining) [2022-11-02 20:57:41,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (121 of 129 remaining) [2022-11-02 20:57:41,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (120 of 129 remaining) [2022-11-02 20:57:41,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (119 of 129 remaining) [2022-11-02 20:57:41,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (118 of 129 remaining) [2022-11-02 20:57:41,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (117 of 129 remaining) [2022-11-02 20:57:41,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (116 of 129 remaining) [2022-11-02 20:57:41,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (115 of 129 remaining) [2022-11-02 20:57:41,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (114 of 129 remaining) [2022-11-02 20:57:41,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (113 of 129 remaining) [2022-11-02 20:57:41,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (112 of 129 remaining) [2022-11-02 20:57:41,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (111 of 129 remaining) [2022-11-02 20:57:41,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (110 of 129 remaining) [2022-11-02 20:57:41,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (109 of 129 remaining) [2022-11-02 20:57:41,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (108 of 129 remaining) [2022-11-02 20:57:41,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (107 of 129 remaining) [2022-11-02 20:57:41,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (106 of 129 remaining) [2022-11-02 20:57:41,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (105 of 129 remaining) [2022-11-02 20:57:41,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (104 of 129 remaining) [2022-11-02 20:57:41,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (103 of 129 remaining) [2022-11-02 20:57:41,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 129 remaining) [2022-11-02 20:57:41,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (101 of 129 remaining) [2022-11-02 20:57:41,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (100 of 129 remaining) [2022-11-02 20:57:41,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (99 of 129 remaining) [2022-11-02 20:57:41,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (98 of 129 remaining) [2022-11-02 20:57:41,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (97 of 129 remaining) [2022-11-02 20:57:41,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (96 of 129 remaining) [2022-11-02 20:57:41,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (95 of 129 remaining) [2022-11-02 20:57:41,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (94 of 129 remaining) [2022-11-02 20:57:41,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (93 of 129 remaining) [2022-11-02 20:57:41,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 129 remaining) [2022-11-02 20:57:41,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 129 remaining) [2022-11-02 20:57:41,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 129 remaining) [2022-11-02 20:57:41,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 129 remaining) [2022-11-02 20:57:41,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 129 remaining) [2022-11-02 20:57:41,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 129 remaining) [2022-11-02 20:57:41,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 129 remaining) [2022-11-02 20:57:41,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 129 remaining) [2022-11-02 20:57:41,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 129 remaining) [2022-11-02 20:57:41,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (83 of 129 remaining) [2022-11-02 20:57:41,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (82 of 129 remaining) [2022-11-02 20:57:41,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (81 of 129 remaining) [2022-11-02 20:57:41,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 129 remaining) [2022-11-02 20:57:41,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (79 of 129 remaining) [2022-11-02 20:57:41,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (78 of 129 remaining) [2022-11-02 20:57:41,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (77 of 129 remaining) [2022-11-02 20:57:41,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (76 of 129 remaining) [2022-11-02 20:57:41,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (75 of 129 remaining) [2022-11-02 20:57:41,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 129 remaining) [2022-11-02 20:57:41,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 129 remaining) [2022-11-02 20:57:41,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 129 remaining) [2022-11-02 20:57:41,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 129 remaining) [2022-11-02 20:57:41,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 129 remaining) [2022-11-02 20:57:41,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 129 remaining) [2022-11-02 20:57:41,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 129 remaining) [2022-11-02 20:57:41,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 129 remaining) [2022-11-02 20:57:41,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 129 remaining) [2022-11-02 20:57:41,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 129 remaining) [2022-11-02 20:57:41,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 129 remaining) [2022-11-02 20:57:41,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 129 remaining) [2022-11-02 20:57:41,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 129 remaining) [2022-11-02 20:57:41,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (61 of 129 remaining) [2022-11-02 20:57:41,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 129 remaining) [2022-11-02 20:57:41,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (59 of 129 remaining) [2022-11-02 20:57:41,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (58 of 129 remaining) [2022-11-02 20:57:41,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (57 of 129 remaining) [2022-11-02 20:57:41,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 129 remaining) [2022-11-02 20:57:41,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 129 remaining) [2022-11-02 20:57:41,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 129 remaining) [2022-11-02 20:57:41,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 129 remaining) [2022-11-02 20:57:41,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (52 of 129 remaining) [2022-11-02 20:57:41,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 129 remaining) [2022-11-02 20:57:41,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 129 remaining) [2022-11-02 20:57:41,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 129 remaining) [2022-11-02 20:57:41,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 129 remaining) [2022-11-02 20:57:41,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 129 remaining) [2022-11-02 20:57:41,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 129 remaining) [2022-11-02 20:57:41,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 129 remaining) [2022-11-02 20:57:41,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 129 remaining) [2022-11-02 20:57:41,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (43 of 129 remaining) [2022-11-02 20:57:41,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 129 remaining) [2022-11-02 20:57:41,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (41 of 129 remaining) [2022-11-02 20:57:41,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (40 of 129 remaining) [2022-11-02 20:57:41,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (39 of 129 remaining) [2022-11-02 20:57:41,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 129 remaining) [2022-11-02 20:57:41,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (37 of 129 remaining) [2022-11-02 20:57:41,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 129 remaining) [2022-11-02 20:57:41,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 129 remaining) [2022-11-02 20:57:41,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 129 remaining) [2022-11-02 20:57:41,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 129 remaining) [2022-11-02 20:57:41,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 129 remaining) [2022-11-02 20:57:41,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 129 remaining) [2022-11-02 20:57:41,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 129 remaining) [2022-11-02 20:57:41,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 129 remaining) [2022-11-02 20:57:41,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 129 remaining) [2022-11-02 20:57:41,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 129 remaining) [2022-11-02 20:57:41,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 129 remaining) [2022-11-02 20:57:41,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (25 of 129 remaining) [2022-11-02 20:57:41,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 129 remaining) [2022-11-02 20:57:41,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 129 remaining) [2022-11-02 20:57:41,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 129 remaining) [2022-11-02 20:57:41,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (21 of 129 remaining) [2022-11-02 20:57:41,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (20 of 129 remaining) [2022-11-02 20:57:41,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (19 of 129 remaining) [2022-11-02 20:57:41,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 129 remaining) [2022-11-02 20:57:41,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 129 remaining) [2022-11-02 20:57:41,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 129 remaining) [2022-11-02 20:57:41,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 129 remaining) [2022-11-02 20:57:41,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 129 remaining) [2022-11-02 20:57:41,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 129 remaining) [2022-11-02 20:57:41,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 129 remaining) [2022-11-02 20:57:41,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 129 remaining) [2022-11-02 20:57:41,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 129 remaining) [2022-11-02 20:57:41,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 129 remaining) [2022-11-02 20:57:41,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (8 of 129 remaining) [2022-11-02 20:57:41,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 129 remaining) [2022-11-02 20:57:41,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 129 remaining) [2022-11-02 20:57:41,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 129 remaining) [2022-11-02 20:57:41,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 129 remaining) [2022-11-02 20:57:41,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 129 remaining) [2022-11-02 20:57:41,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 129 remaining) [2022-11-02 20:57:41,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 129 remaining) [2022-11-02 20:57:41,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 129 remaining) [2022-11-02 20:57:41,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:57:41,234 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:41,241 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:57:41,241 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:57:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:57:41 BasicIcfg [2022-11-02 20:57:41,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:57:41,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:57:41,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:57:41,248 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:57:41,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:33" (3/4) ... [2022-11-02 20:57:41,251 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:57:41,256 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:57:41,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:57:41,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:57:41,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-02 20:57:41,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:57:41,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:57:41,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:57:41,322 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:57:41,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:57:41,323 INFO L158 Benchmark]: Toolchain (without parser) took 10567.17ms. Allocated memory was 100.7MB in the beginning and 476.1MB in the end (delta: 375.4MB). Free memory was 65.5MB in the beginning and 375.9MB in the end (delta: -310.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,324 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 71.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:57:41,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.35ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 73.5MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.20ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 69.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,325 INFO L158 Benchmark]: Boogie Preprocessor took 46.10ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 67.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,325 INFO L158 Benchmark]: RCFGBuilder took 2323.63ms. Allocated memory was 100.7MB in the beginning and 169.9MB in the end (delta: 69.2MB). Free memory was 67.0MB in the beginning and 121.6MB in the end (delta: -54.7MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,326 INFO L158 Benchmark]: TraceAbstraction took 7748.11ms. Allocated memory was 169.9MB in the beginning and 476.1MB in the end (delta: 306.2MB). Free memory was 121.6MB in the beginning and 380.1MB in the end (delta: -258.4MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,326 INFO L158 Benchmark]: Witness Printer took 74.41ms. Allocated memory is still 476.1MB. Free memory was 380.1MB in the beginning and 375.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:57:41,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 71.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.35ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 73.5MB in the end (delta: -8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.20ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 69.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.10ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 67.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2323.63ms. Allocated memory was 100.7MB in the beginning and 169.9MB in the end (delta: 69.2MB). Free memory was 67.0MB in the beginning and 121.6MB in the end (delta: -54.7MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7748.11ms. Allocated memory was 169.9MB in the beginning and 476.1MB in the end (delta: 306.2MB). Free memory was 121.6MB in the beginning and 380.1MB in the end (delta: -258.4MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 74.41ms. Allocated memory is still 476.1MB. Free memory was 380.1MB in the beginning and 375.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 342 locations, 129 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 81 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1840 NumberOfCodeBlocks, 1840 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1822 ConstructedInterpolants, 0 QuantifiedInterpolants, 2095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:57:41,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_953c45ec-5a61-4710-b518-9d5454ee6c6b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE