./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/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_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/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_6294bc8b-5707-4275-a073-85a2816a2251/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 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 --- 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:51:10,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:10,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:10,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:10,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:10,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:10,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:10,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:10,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:10,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:10,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:10,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:10,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:10,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:10,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:10,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:10,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:10,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:10,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:10,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:10,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:10,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:10,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:10,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:10,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:10,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:10,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:10,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:10,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:10,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:10,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:10,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:10,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:10,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:10,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:10,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:10,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:10,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:10,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:10,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:10,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:10,580 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:51:10,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:10,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:10,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:10,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:10,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:10,631 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:10,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:10,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:10,632 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:10,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:10,634 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:10,634 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:51:10,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:10,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:10,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:10,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:10,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:10,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:10,635 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:51:10,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:10,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:10,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:10,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:10,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:10,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:10,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:10,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:10,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:10,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:10,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:10,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:10,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:10,639 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:10,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:10,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:10,639 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_6294bc8b-5707-4275-a073-85a2816a2251/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_6294bc8b-5707-4275-a073-85a2816a2251/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 -> 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 [2022-11-02 20:51:10,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:11,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:11,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:11,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:11,011 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:11,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2022-11-02 20:51:11,087 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/data/6578af154/3eb05fa8aaf34150af5147d092d11520/FLAG70506ef76 [2022-11-02 20:51:11,635 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:11,635 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2022-11-02 20:51:11,648 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/data/6578af154/3eb05fa8aaf34150af5147d092d11520/FLAG70506ef76 [2022-11-02 20:51:11,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/data/6578af154/3eb05fa8aaf34150af5147d092d11520 [2022-11-02 20:51:11,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:11,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:11,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:11,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:11,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:11,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:11" (1/1) ... [2022-11-02 20:51:11,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad4d32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:11, skipping insertion in model container [2022-11-02 20:51:11,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:11" (1/1) ... [2022-11-02 20:51:11,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:11,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:12,253 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_6294bc8b-5707-4275-a073-85a2816a2251/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-11-02 20:51:12,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:12,269 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:12,313 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_6294bc8b-5707-4275-a073-85a2816a2251/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-11-02 20:51:12,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:12,334 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:12,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12 WrapperNode [2022-11-02 20:51:12,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:12,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:12,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:12,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:12,343 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:51:12" (1/1) ... [2022-11-02 20:51:12,357 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:51:12" (1/1) ... [2022-11-02 20:51:12,420 INFO L138 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 607 [2022-11-02 20:51:12,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:12,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:12,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:12,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:12,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,525 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:12,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:12,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:12,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:12,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (1/1) ... [2022-11-02 20:51:12,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:12,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:12,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:51:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:51:12,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:51:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:51:12,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:51:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:51:12,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:51:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:51:12,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:51:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:51:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:51:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:51:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:12,632 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:51:12,827 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:12,829 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:13,732 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:14,349 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:14,349 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:51:14,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:14 BoogieIcfgContainer [2022-11-02 20:51:14,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:14,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:14,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:14,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:14,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:11" (1/3) ... [2022-11-02 20:51:14,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b843ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:14, skipping insertion in model container [2022-11-02 20:51:14,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:12" (2/3) ... [2022-11-02 20:51:14,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b843ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:14, skipping insertion in model container [2022-11-02 20:51:14,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:14" (3/3) ... [2022-11-02 20:51:14,373 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2022-11-02 20:51:14,387 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:51:14,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:14,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 93 error locations. [2022-11-02 20:51:14,398 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:51:14,600 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:51:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 416 transitions, 864 flow [2022-11-02 20:51:14,828 INFO L130 PetriNetUnfolder]: 19/412 cut-off events. [2022-11-02 20:51:14,828 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:51:14,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 412 events. 19/412 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 560 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 327. Up to 2 conditions per place. [2022-11-02 20:51:14,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 416 transitions, 864 flow [2022-11-02 20:51:14,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 385 places, 390 transitions, 804 flow [2022-11-02 20:51:14,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:14,867 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;@774fecda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:14,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 167 error locations. [2022-11-02 20:51:14,873 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-11-02 20:51:14,873 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:14,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:14,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:14,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash 151638200, now seen corresponding path program 1 times [2022-11-02 20:51:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:14,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25747799] [2022-11-02 20:51:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,157 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:51:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25747799] [2022-11-02 20:51:15,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25747799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:15,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:15,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294057265] [2022-11-02 20:51:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:15,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:15,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:15,205 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 416 [2022-11-02 20:51:15,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 390 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:15,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:15,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 416 [2022-11-02 20:51:15,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:16,153 INFO L130 PetriNetUnfolder]: 745/1745 cut-off events. [2022-11-02 20:51:16,153 INFO L131 PetriNetUnfolder]: For 299/405 co-relation queries the response was YES. [2022-11-02 20:51:16,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1745 events. 745/1745 cut-off events. For 299/405 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9198 event pairs, 485 based on Foata normal form. 264/1782 useless extension candidates. Maximal degree in co-relation 2559. Up to 1010 conditions per place. [2022-11-02 20:51:16,174 INFO L137 encePairwiseOnDemand]: 332/416 looper letters, 28 selfloop transitions, 2 changer transitions 5/308 dead transitions. [2022-11-02 20:51:16,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 308 transitions, 700 flow [2022-11-02 20:51:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-02 20:51:16,199 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8157051282051282 [2022-11-02 20:51:16,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-02 20:51:16,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-02 20:51:16,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:16,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-02 20:51:16,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:16,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:16,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:16,228 INFO L175 Difference]: Start difference. First operand has 385 places, 390 transitions, 804 flow. Second operand 3 states and 1018 transitions. [2022-11-02 20:51:16,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 308 transitions, 700 flow [2022-11-02 20:51:16,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 308 transitions, 684 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:51:16,250 INFO L231 Difference]: Finished difference. Result has 308 places, 303 transitions, 618 flow [2022-11-02 20:51:16,253 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=308, PETRI_TRANSITIONS=303} [2022-11-02 20:51:16,259 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -77 predicate places. [2022-11-02 20:51:16,259 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 303 transitions, 618 flow [2022-11-02 20:51:16,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:16,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:16,260 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] [2022-11-02 20:51:16,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:16,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash 934633190, now seen corresponding path program 1 times [2022-11-02 20:51:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:16,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210983964] [2022-11-02 20:51:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:16,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:16,402 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:51:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:16,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210983964] [2022-11-02 20:51:16,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210983964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:16,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919374480] [2022-11-02 20:51:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:16,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:16,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:16,408 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 416 [2022-11-02 20:51:16,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 303 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:16,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:16,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 416 [2022-11-02 20:51:16,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:17,030 INFO L130 PetriNetUnfolder]: 745/1739 cut-off events. [2022-11-02 20:51:17,030 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:51:17,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1739 events. 745/1739 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9188 event pairs, 485 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2782. Up to 1010 conditions per place. [2022-11-02 20:51:17,045 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 28 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-02 20:51:17,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 676 flow [2022-11-02 20:51:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2022-11-02 20:51:17,048 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.750801282051282 [2022-11-02 20:51:17,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 937 transitions. [2022-11-02 20:51:17,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 937 transitions. [2022-11-02 20:51:17,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:17,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 937 transitions. [2022-11-02 20:51:17,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,055 INFO L175 Difference]: Start difference. First operand has 308 places, 303 transitions, 618 flow. Second operand 3 states and 937 transitions. [2022-11-02 20:51:17,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 676 flow [2022-11-02 20:51:17,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:17,062 INFO L231 Difference]: Finished difference. Result has 302 places, 302 transitions, 616 flow [2022-11-02 20:51:17,063 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=302, PETRI_TRANSITIONS=302} [2022-11-02 20:51:17,064 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -83 predicate places. [2022-11-02 20:51:17,064 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 302 transitions, 616 flow [2022-11-02 20:51:17,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:17,065 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] [2022-11-02 20:51:17,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:17,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 269285215, now seen corresponding path program 1 times [2022-11-02 20:51:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:17,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735286818] [2022-11-02 20:51:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:17,124 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:51:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:17,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735286818] [2022-11-02 20:51:17,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735286818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:17,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:17,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891853413] [2022-11-02 20:51:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:17,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:17,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:17,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:17,128 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 416 [2022-11-02 20:51:17,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 302 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:17,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 416 [2022-11-02 20:51:17,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:17,773 INFO L130 PetriNetUnfolder]: 745/1738 cut-off events. [2022-11-02 20:51:17,774 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:51:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 1738 events. 745/1738 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9153 event pairs, 485 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2774. Up to 1010 conditions per place. [2022-11-02 20:51:17,789 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 28 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-02 20:51:17,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 301 transitions, 674 flow [2022-11-02 20:51:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2022-11-02 20:51:17,795 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.750801282051282 [2022-11-02 20:51:17,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 937 transitions. [2022-11-02 20:51:17,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 937 transitions. [2022-11-02 20:51:17,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:17,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 937 transitions. [2022-11-02 20:51:17,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,803 INFO L175 Difference]: Start difference. First operand has 302 places, 302 transitions, 616 flow. Second operand 3 states and 937 transitions. [2022-11-02 20:51:17,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 301 transitions, 674 flow [2022-11-02 20:51:17,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:17,810 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 614 flow [2022-11-02 20:51:17,811 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-02 20:51:17,813 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -84 predicate places. [2022-11-02 20:51:17,813 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 614 flow [2022-11-02 20:51:17,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:17,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:17,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:17,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1640239749, now seen corresponding path program 1 times [2022-11-02 20:51:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:17,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430627104] [2022-11-02 20:51:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:17,915 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:51:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:17,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430627104] [2022-11-02 20:51:17,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430627104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:17,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:17,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880699263] [2022-11-02 20:51:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:17,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:17,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:17,920 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 416 [2022-11-02 20:51:17,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:17,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 416 [2022-11-02 20:51:17,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:18,509 INFO L130 PetriNetUnfolder]: 745/1737 cut-off events. [2022-11-02 20:51:18,509 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:51:18,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1737 events. 745/1737 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9119 event pairs, 485 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2766. Up to 1010 conditions per place. [2022-11-02 20:51:18,524 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 28 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2022-11-02 20:51:18,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 672 flow [2022-11-02 20:51:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2022-11-02 20:51:18,528 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.750801282051282 [2022-11-02 20:51:18,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 937 transitions. [2022-11-02 20:51:18,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 937 transitions. [2022-11-02 20:51:18,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:18,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 937 transitions. [2022-11-02 20:51:18,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,535 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 614 flow. Second operand 3 states and 937 transitions. [2022-11-02 20:51:18,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 672 flow [2022-11-02 20:51:18,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 300 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:18,542 INFO L231 Difference]: Finished difference. Result has 300 places, 300 transitions, 612 flow [2022-11-02 20:51:18,542 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=300, PETRI_TRANSITIONS=300} [2022-11-02 20:51:18,543 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -85 predicate places. [2022-11-02 20:51:18,543 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 300 transitions, 612 flow [2022-11-02 20:51:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:18,545 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] [2022-11-02 20:51:18,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:18,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 601352178, now seen corresponding path program 1 times [2022-11-02 20:51:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:18,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555999335] [2022-11-02 20:51:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,592 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:51:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555999335] [2022-11-02 20:51:18,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555999335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:18,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:18,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683328955] [2022-11-02 20:51:18,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:18,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:18,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:18,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:18,596 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 416 [2022-11-02 20:51:18,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 300 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:18,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 416 [2022-11-02 20:51:18,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:19,199 INFO L130 PetriNetUnfolder]: 745/1736 cut-off events. [2022-11-02 20:51:19,199 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:51:19,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1736 events. 745/1736 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9160 event pairs, 485 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2758. Up to 1010 conditions per place. [2022-11-02 20:51:19,216 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 28 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2022-11-02 20:51:19,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 299 transitions, 670 flow [2022-11-02 20:51:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2022-11-02 20:51:19,220 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.750801282051282 [2022-11-02 20:51:19,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 937 transitions. [2022-11-02 20:51:19,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 937 transitions. [2022-11-02 20:51:19,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:19,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 937 transitions. [2022-11-02 20:51:19,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:19,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:19,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:19,228 INFO L175 Difference]: Start difference. First operand has 300 places, 300 transitions, 612 flow. Second operand 3 states and 937 transitions. [2022-11-02 20:51:19,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 299 transitions, 670 flow [2022-11-02 20:51:19,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 299 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:19,236 INFO L231 Difference]: Finished difference. Result has 299 places, 299 transitions, 610 flow [2022-11-02 20:51:19,236 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=299, PETRI_TRANSITIONS=299} [2022-11-02 20:51:19,237 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -86 predicate places. [2022-11-02 20:51:19,237 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 299 transitions, 610 flow [2022-11-02 20:51:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:19,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:19,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:19,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:19,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 667138866, now seen corresponding path program 1 times [2022-11-02 20:51:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467463347] [2022-11-02 20:51:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:19,294 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:51:19,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:19,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467463347] [2022-11-02 20:51:19,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467463347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:19,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:19,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236555727] [2022-11-02 20:51:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:19,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:19,308 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:19,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:19,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:19,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:19,988 INFO L130 PetriNetUnfolder]: 982/2314 cut-off events. [2022-11-02 20:51:19,989 INFO L131 PetriNetUnfolder]: For 69/206 co-relation queries the response was YES. [2022-11-02 20:51:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 2314 events. 982/2314 cut-off events. For 69/206 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13644 event pairs, 307 based on Foata normal form. 0/2028 useless extension candidates. Maximal degree in co-relation 3660. Up to 715 conditions per place. [2022-11-02 20:51:20,011 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 41 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-02 20:51:20,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 315 transitions, 733 flow [2022-11-02 20:51:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-02 20:51:20,015 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7684294871794872 [2022-11-02 20:51:20,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-02 20:51:20,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-02 20:51:20,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:20,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-02 20:51:20,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,023 INFO L175 Difference]: Start difference. First operand has 299 places, 299 transitions, 610 flow. Second operand 3 states and 959 transitions. [2022-11-02 20:51:20,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 315 transitions, 733 flow [2022-11-02 20:51:20,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 315 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:20,031 INFO L231 Difference]: Finished difference. Result has 299 places, 299 transitions, 614 flow [2022-11-02 20:51:20,031 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=299, PETRI_TRANSITIONS=299} [2022-11-02 20:51:20,032 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -86 predicate places. [2022-11-02 20:51:20,032 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 299 transitions, 614 flow [2022-11-02 20:51:20,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:20,033 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:51:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:20,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -551918573, now seen corresponding path program 1 times [2022-11-02 20:51:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:20,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675038721] [2022-11-02 20:51:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:20,082 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:51:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:20,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675038721] [2022-11-02 20:51:20,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675038721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:20,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:20,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051151167] [2022-11-02 20:51:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:20,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:20,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:20,087 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:20,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 299 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:20,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:20,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:20,702 INFO L130 PetriNetUnfolder]: 982/2301 cut-off events. [2022-11-02 20:51:20,702 INFO L131 PetriNetUnfolder]: For 227/364 co-relation queries the response was YES. [2022-11-02 20:51:20,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 2301 events. 982/2301 cut-off events. For 227/364 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13835 event pairs, 665 based on Foata normal form. 0/2011 useless extension candidates. Maximal degree in co-relation 2084. Up to 1327 conditions per place. [2022-11-02 20:51:20,721 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 26 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2022-11-02 20:51:20,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 298 transitions, 668 flow [2022-11-02 20:51:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2022-11-02 20:51:20,724 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7556089743589743 [2022-11-02 20:51:20,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 943 transitions. [2022-11-02 20:51:20,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 943 transitions. [2022-11-02 20:51:20,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:20,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 943 transitions. [2022-11-02 20:51:20,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,731 INFO L175 Difference]: Start difference. First operand has 299 places, 299 transitions, 614 flow. Second operand 3 states and 943 transitions. [2022-11-02 20:51:20,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 298 transitions, 668 flow [2022-11-02 20:51:20,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 298 transitions, 666 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:20,737 INFO L231 Difference]: Finished difference. Result has 299 places, 298 transitions, 614 flow [2022-11-02 20:51:20,737 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=299, PETRI_TRANSITIONS=298} [2022-11-02 20:51:20,738 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -86 predicate places. [2022-11-02 20:51:20,739 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 298 transitions, 614 flow [2022-11-02 20:51:20,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:20,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:20,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:20,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -677034231, now seen corresponding path program 1 times [2022-11-02 20:51:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654467286] [2022-11-02 20:51:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:20,825 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:51:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:20,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654467286] [2022-11-02 20:51:20,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654467286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:20,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:20,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567955863] [2022-11-02 20:51:20,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:20,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:20,828 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 416 [2022-11-02 20:51:20,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 298 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:20,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 416 [2022-11-02 20:51:20,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:21,501 INFO L130 PetriNetUnfolder]: 982/2300 cut-off events. [2022-11-02 20:51:21,502 INFO L131 PetriNetUnfolder]: For 226/363 co-relation queries the response was YES. [2022-11-02 20:51:21,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3881 conditions, 2300 events. 982/2300 cut-off events. For 226/363 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13816 event pairs, 665 based on Foata normal form. 0/2011 useless extension candidates. Maximal degree in co-relation 3802. Up to 1330 conditions per place. [2022-11-02 20:51:21,521 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 29 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-11-02 20:51:21,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 297 transitions, 674 flow [2022-11-02 20:51:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2022-11-02 20:51:21,524 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.750801282051282 [2022-11-02 20:51:21,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 937 transitions. [2022-11-02 20:51:21,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 937 transitions. [2022-11-02 20:51:21,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:21,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 937 transitions. [2022-11-02 20:51:21,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,530 INFO L175 Difference]: Start difference. First operand has 299 places, 298 transitions, 614 flow. Second operand 3 states and 937 transitions. [2022-11-02 20:51:21,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 297 transitions, 674 flow [2022-11-02 20:51:21,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 297 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:21,536 INFO L231 Difference]: Finished difference. Result has 298 places, 297 transitions, 612 flow [2022-11-02 20:51:21,537 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=298, PETRI_TRANSITIONS=297} [2022-11-02 20:51:21,537 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:21,538 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 297 transitions, 612 flow [2022-11-02 20:51:21,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:21,538 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] [2022-11-02 20:51:21,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:21,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1768851481, now seen corresponding path program 1 times [2022-11-02 20:51:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830742249] [2022-11-02 20:51:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:21,578 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:51:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:21,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830742249] [2022-11-02 20:51:21,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830742249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:21,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:21,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858106044] [2022-11-02 20:51:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:21,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:21,581 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:21,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 297 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:21,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:21,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:22,549 INFO L130 PetriNetUnfolder]: 1232/2987 cut-off events. [2022-11-02 20:51:22,549 INFO L131 PetriNetUnfolder]: For 293/461 co-relation queries the response was YES. [2022-11-02 20:51:22,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4944 conditions, 2987 events. 1232/2987 cut-off events. For 293/461 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20013 event pairs, 472 based on Foata normal form. 0/2607 useless extension candidates. Maximal degree in co-relation 4857. Up to 903 conditions per place. [2022-11-02 20:51:22,577 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 42 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2022-11-02 20:51:22,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 313 transitions, 740 flow [2022-11-02 20:51:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2022-11-02 20:51:22,581 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7676282051282052 [2022-11-02 20:51:22,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2022-11-02 20:51:22,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2022-11-02 20:51:22,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:22,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2022-11-02 20:51:22,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:22,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:22,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:22,589 INFO L175 Difference]: Start difference. First operand has 298 places, 297 transitions, 612 flow. Second operand 3 states and 958 transitions. [2022-11-02 20:51:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 313 transitions, 740 flow [2022-11-02 20:51:22,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 313 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:22,599 INFO L231 Difference]: Finished difference. Result has 298 places, 297 transitions, 616 flow [2022-11-02 20:51:22,599 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=298, PETRI_TRANSITIONS=297} [2022-11-02 20:51:22,601 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:22,601 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 297 transitions, 616 flow [2022-11-02 20:51:22,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:22,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:22,603 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:51:22,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:22,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2090883413, now seen corresponding path program 1 times [2022-11-02 20:51:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:22,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088638758] [2022-11-02 20:51:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:22,688 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:51:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:22,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088638758] [2022-11-02 20:51:22,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088638758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:22,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:22,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562819076] [2022-11-02 20:51:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:22,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:22,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:22,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:22,692 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:22,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 297 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:22,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:22,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:23,539 INFO L130 PetriNetUnfolder]: 1232/2986 cut-off events. [2022-11-02 20:51:23,539 INFO L131 PetriNetUnfolder]: For 465/633 co-relation queries the response was YES. [2022-11-02 20:51:23,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5202 conditions, 2986 events. 1232/2986 cut-off events. For 465/633 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20059 event pairs, 858 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 3028. Up to 1665 conditions per place. [2022-11-02 20:51:23,568 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 27 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-11-02 20:51:23,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 296 transitions, 672 flow [2022-11-02 20:51:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2022-11-02 20:51:23,571 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7556089743589743 [2022-11-02 20:51:23,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 943 transitions. [2022-11-02 20:51:23,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 943 transitions. [2022-11-02 20:51:23,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:23,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 943 transitions. [2022-11-02 20:51:23,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,578 INFO L175 Difference]: Start difference. First operand has 298 places, 297 transitions, 616 flow. Second operand 3 states and 943 transitions. [2022-11-02 20:51:23,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 296 transitions, 672 flow [2022-11-02 20:51:23,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 296 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:23,585 INFO L231 Difference]: Finished difference. Result has 298 places, 296 transitions, 616 flow [2022-11-02 20:51:23,585 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=298, PETRI_TRANSITIONS=296} [2022-11-02 20:51:23,586 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:23,586 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 296 transitions, 616 flow [2022-11-02 20:51:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:23,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:23,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:51:23,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 404545818, now seen corresponding path program 1 times [2022-11-02 20:51:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:23,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524366805] [2022-11-02 20:51:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:23,624 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:51:23,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:23,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524366805] [2022-11-02 20:51:23,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524366805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:23,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:23,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852494830] [2022-11-02 20:51:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:23,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:23,628 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:23,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 296 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:23,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:23,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:24,348 INFO L130 PetriNetUnfolder]: 1232/2985 cut-off events. [2022-11-02 20:51:24,348 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:51:24,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 2985 events. 1232/2985 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20026 event pairs, 858 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 5020. Up to 1663 conditions per place. [2022-11-02 20:51:24,373 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 27 selfloop transitions, 1 changer transitions 0/295 dead transitions. [2022-11-02 20:51:24,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 295 transitions, 670 flow [2022-11-02 20:51:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2022-11-02 20:51:24,376 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548076923076923 [2022-11-02 20:51:24,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2022-11-02 20:51:24,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2022-11-02 20:51:24,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:24,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2022-11-02 20:51:24,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,384 INFO L175 Difference]: Start difference. First operand has 298 places, 296 transitions, 616 flow. Second operand 3 states and 942 transitions. [2022-11-02 20:51:24,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 295 transitions, 670 flow [2022-11-02 20:51:24,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 295 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:24,390 INFO L231 Difference]: Finished difference. Result has 297 places, 295 transitions, 612 flow [2022-11-02 20:51:24,391 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=297, PETRI_TRANSITIONS=295} [2022-11-02 20:51:24,391 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -88 predicate places. [2022-11-02 20:51:24,392 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 295 transitions, 612 flow [2022-11-02 20:51:24,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:24,393 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] [2022-11-02 20:51:24,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:51:24,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1863169209, now seen corresponding path program 1 times [2022-11-02 20:51:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:24,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778760791] [2022-11-02 20:51:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:24,445 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:51:24,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:24,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778760791] [2022-11-02 20:51:24,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778760791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:24,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:24,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:24,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624635080] [2022-11-02 20:51:24,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:24,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:24,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:24,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:24,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:24,449 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:24,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 295 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:24,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:24,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:25,233 INFO L130 PetriNetUnfolder]: 1232/2984 cut-off events. [2022-11-02 20:51:25,233 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:51:25,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5115 conditions, 2984 events. 1232/2984 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19987 event pairs, 858 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 5020. Up to 1665 conditions per place. [2022-11-02 20:51:25,255 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 27 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2022-11-02 20:51:25,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 294 transitions, 668 flow [2022-11-02 20:51:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2022-11-02 20:51:25,258 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7556089743589743 [2022-11-02 20:51:25,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 943 transitions. [2022-11-02 20:51:25,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 943 transitions. [2022-11-02 20:51:25,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:25,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 943 transitions. [2022-11-02 20:51:25,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,265 INFO L175 Difference]: Start difference. First operand has 297 places, 295 transitions, 612 flow. Second operand 3 states and 943 transitions. [2022-11-02 20:51:25,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 294 transitions, 668 flow [2022-11-02 20:51:25,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 294 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:25,271 INFO L231 Difference]: Finished difference. Result has 297 places, 294 transitions, 613 flow [2022-11-02 20:51:25,272 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=297, PETRI_TRANSITIONS=294} [2022-11-02 20:51:25,273 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -88 predicate places. [2022-11-02 20:51:25,273 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 294 transitions, 613 flow [2022-11-02 20:51:25,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:25,274 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] [2022-11-02 20:51:25,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:51:25,275 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 827120072, now seen corresponding path program 1 times [2022-11-02 20:51:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27335693] [2022-11-02 20:51:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,771 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:51:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:25,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27335693] [2022-11-02 20:51:25,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27335693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:25,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:25,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877442608] [2022-11-02 20:51:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:25,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:25,775 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 416 [2022-11-02 20:51:25,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 294 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 254.83333333333334) internal successors, (1529), 6 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:25,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 416 [2022-11-02 20:51:25,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:29,777 INFO L130 PetriNetUnfolder]: 8768/13160 cut-off events. [2022-11-02 20:51:29,778 INFO L131 PetriNetUnfolder]: For 2412/2412 co-relation queries the response was YES. [2022-11-02 20:51:29,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26960 conditions, 13160 events. 8768/13160 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 74560 event pairs, 6510 based on Foata normal form. 0/12377 useless extension candidates. Maximal degree in co-relation 26866. Up to 11284 conditions per place. [2022-11-02 20:51:29,875 INFO L137 encePairwiseOnDemand]: 404/416 looper letters, 70 selfloop transitions, 10 changer transitions 0/292 dead transitions. [2022-11-02 20:51:29,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 292 transitions, 769 flow [2022-11-02 20:51:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1598 transitions. [2022-11-02 20:51:29,880 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6402243589743589 [2022-11-02 20:51:29,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1598 transitions. [2022-11-02 20:51:29,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1598 transitions. [2022-11-02 20:51:29,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:29,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1598 transitions. [2022-11-02 20:51:29,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 266.3333333333333) internal successors, (1598), 6 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,891 INFO L175 Difference]: Start difference. First operand has 297 places, 294 transitions, 613 flow. Second operand 6 states and 1598 transitions. [2022-11-02 20:51:29,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 292 transitions, 769 flow [2022-11-02 20:51:29,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 292 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:29,898 INFO L231 Difference]: Finished difference. Result has 298 places, 292 transitions, 625 flow [2022-11-02 20:51:29,899 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=625, PETRI_PLACES=298, PETRI_TRANSITIONS=292} [2022-11-02 20:51:29,900 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:29,900 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 292 transitions, 625 flow [2022-11-02 20:51:29,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.83333333333334) internal successors, (1529), 6 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:29,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:51:29,903 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash 373852087, now seen corresponding path program 1 times [2022-11-02 20:51:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:29,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852570004] [2022-11-02 20:51:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,969 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:51:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:29,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852570004] [2022-11-02 20:51:29,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852570004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:29,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:29,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569678501] [2022-11-02 20:51:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:29,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:29,973 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:29,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 292 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:29,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:30,768 INFO L130 PetriNetUnfolder]: 1232/2981 cut-off events. [2022-11-02 20:51:30,768 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:51:30,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5121 conditions, 2981 events. 1232/2981 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20066 event pairs, 858 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 5086. Up to 1663 conditions per place. [2022-11-02 20:51:30,795 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 27 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2022-11-02 20:51:30,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 291 transitions, 679 flow [2022-11-02 20:51:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2022-11-02 20:51:30,799 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548076923076923 [2022-11-02 20:51:30,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2022-11-02 20:51:30,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2022-11-02 20:51:30,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:30,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2022-11-02 20:51:30,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:30,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:30,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:30,805 INFO L175 Difference]: Start difference. First operand has 298 places, 292 transitions, 625 flow. Second operand 3 states and 942 transitions. [2022-11-02 20:51:30,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 291 transitions, 679 flow [2022-11-02 20:51:30,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 291 transitions, 659 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:51:30,812 INFO L231 Difference]: Finished difference. Result has 294 places, 291 transitions, 605 flow [2022-11-02 20:51:30,812 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=294, PETRI_TRANSITIONS=291} [2022-11-02 20:51:30,813 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -91 predicate places. [2022-11-02 20:51:30,813 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 291 transitions, 605 flow [2022-11-02 20:51:30,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:30,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:30,814 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:51:30,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:51:30,815 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 346307011, now seen corresponding path program 1 times [2022-11-02 20:51:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:30,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083047066] [2022-11-02 20:51:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:30,882 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:51:30,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:30,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083047066] [2022-11-02 20:51:30,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083047066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:30,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:30,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722677580] [2022-11-02 20:51:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:30,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:30,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:30,885 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:30,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 291 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:30,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:30,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:30,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:31,679 INFO L130 PetriNetUnfolder]: 1232/2980 cut-off events. [2022-11-02 20:51:31,679 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:51:31,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 2980 events. 1232/2980 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20027 event pairs, 858 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 5017. Up to 1665 conditions per place. [2022-11-02 20:51:31,700 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 27 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2022-11-02 20:51:31,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 290 transitions, 661 flow [2022-11-02 20:51:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2022-11-02 20:51:31,703 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7556089743589743 [2022-11-02 20:51:31,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 943 transitions. [2022-11-02 20:51:31,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 943 transitions. [2022-11-02 20:51:31,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:31,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 943 transitions. [2022-11-02 20:51:31,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,710 INFO L175 Difference]: Start difference. First operand has 294 places, 291 transitions, 605 flow. Second operand 3 states and 943 transitions. [2022-11-02 20:51:31,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 290 transitions, 661 flow [2022-11-02 20:51:31,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 290 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:31,717 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 606 flow [2022-11-02 20:51:31,717 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2022-11-02 20:51:31,718 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -91 predicate places. [2022-11-02 20:51:31,718 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 606 flow [2022-11-02 20:51:31,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:31,719 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] [2022-11-02 20:51:31,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:51:31,720 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1407448907, now seen corresponding path program 1 times [2022-11-02 20:51:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:31,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249876332] [2022-11-02 20:51:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:31,776 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:51:31,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:31,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249876332] [2022-11-02 20:51:31,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249876332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:31,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:31,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202182590] [2022-11-02 20:51:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:31,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:31,780 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:31,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:31,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:31,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:32,423 INFO L130 PetriNetUnfolder]: 1232/2979 cut-off events. [2022-11-02 20:51:32,423 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:51:32,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 2979 events. 1232/2979 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20043 event pairs, 858 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 5016. Up to 1663 conditions per place. [2022-11-02 20:51:32,446 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 27 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2022-11-02 20:51:32,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 660 flow [2022-11-02 20:51:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2022-11-02 20:51:32,450 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548076923076923 [2022-11-02 20:51:32,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2022-11-02 20:51:32,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2022-11-02 20:51:32,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:32,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2022-11-02 20:51:32,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,456 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 606 flow. Second operand 3 states and 942 transitions. [2022-11-02 20:51:32,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 660 flow [2022-11-02 20:51:32,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 289 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:32,463 INFO L231 Difference]: Finished difference. Result has 293 places, 289 transitions, 602 flow [2022-11-02 20:51:32,464 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=293, PETRI_TRANSITIONS=289} [2022-11-02 20:51:32,464 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -92 predicate places. [2022-11-02 20:51:32,464 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 289 transitions, 602 flow [2022-11-02 20:51:32,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:32,465 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] [2022-11-02 20:51:32,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:51:32,466 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1243377447, now seen corresponding path program 1 times [2022-11-02 20:51:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:32,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800767544] [2022-11-02 20:51:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,524 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:51:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:32,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800767544] [2022-11-02 20:51:32,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800767544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:32,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:32,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720121015] [2022-11-02 20:51:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:32,527 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 416 [2022-11-02 20:51:32,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 289 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:32,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 416 [2022-11-02 20:51:32,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:33,393 INFO L130 PetriNetUnfolder]: 1241/3026 cut-off events. [2022-11-02 20:51:33,394 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:51:33,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5176 conditions, 3026 events. 1241/3026 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20377 event pairs, 675 based on Foata normal form. 1/2653 useless extension candidates. Maximal degree in co-relation 5080. Up to 1673 conditions per place. [2022-11-02 20:51:33,415 INFO L137 encePairwiseOnDemand]: 410/416 looper letters, 31 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2022-11-02 20:51:33,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 296 transitions, 692 flow [2022-11-02 20:51:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2022-11-02 20:51:33,418 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7612179487179487 [2022-11-02 20:51:33,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 950 transitions. [2022-11-02 20:51:33,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 950 transitions. [2022-11-02 20:51:33,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:33,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 950 transitions. [2022-11-02 20:51:33,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,424 INFO L175 Difference]: Start difference. First operand has 293 places, 289 transitions, 602 flow. Second operand 3 states and 950 transitions. [2022-11-02 20:51:33,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 296 transitions, 692 flow [2022-11-02 20:51:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 296 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:33,430 INFO L231 Difference]: Finished difference. Result has 294 places, 292 transitions, 630 flow [2022-11-02 20:51:33,431 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=294, PETRI_TRANSITIONS=292} [2022-11-02 20:51:33,431 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -91 predicate places. [2022-11-02 20:51:33,431 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 292 transitions, 630 flow [2022-11-02 20:51:33,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:33,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:33,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:51:33,433 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:33,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1705207855, now seen corresponding path program 1 times [2022-11-02 20:51:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:33,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493957003] [2022-11-02 20:51:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:34,103 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:51:34,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:34,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493957003] [2022-11-02 20:51:34,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493957003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:34,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:34,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122781628] [2022-11-02 20:51:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:34,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:34,108 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 416 [2022-11-02 20:51:34,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 292 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 271.1666666666667) internal successors, (1627), 6 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:34,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:34,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 416 [2022-11-02 20:51:34,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:38,268 INFO L130 PetriNetUnfolder]: 8801/13226 cut-off events. [2022-11-02 20:51:38,268 INFO L131 PetriNetUnfolder]: For 4508/4508 co-relation queries the response was YES. [2022-11-02 20:51:38,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29381 conditions, 13226 events. 8801/13226 cut-off events. For 4508/4508 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 74473 event pairs, 1269 based on Foata normal form. 0/12710 useless extension candidates. Maximal degree in co-relation 29285. Up to 4814 conditions per place. [2022-11-02 20:51:38,376 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 141 selfloop transitions, 4 changer transitions 0/371 dead transitions. [2022-11-02 20:51:38,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 371 transitions, 1190 flow [2022-11-02 20:51:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1730 transitions. [2022-11-02 20:51:38,383 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6931089743589743 [2022-11-02 20:51:38,383 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1730 transitions. [2022-11-02 20:51:38,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1730 transitions. [2022-11-02 20:51:38,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:38,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1730 transitions. [2022-11-02 20:51:38,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 288.3333333333333) internal successors, (1730), 6 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:38,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:38,396 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:38,396 INFO L175 Difference]: Start difference. First operand has 294 places, 292 transitions, 630 flow. Second operand 6 states and 1730 transitions. [2022-11-02 20:51:38,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 371 transitions, 1190 flow [2022-11-02 20:51:38,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 371 transitions, 1190 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:38,410 INFO L231 Difference]: Finished difference. Result has 298 places, 291 transitions, 636 flow [2022-11-02 20:51:38,411 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=298, PETRI_TRANSITIONS=291} [2022-11-02 20:51:38,411 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:38,412 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 291 transitions, 636 flow [2022-11-02 20:51:38,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 271.1666666666667) internal successors, (1627), 6 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:38,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:38,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:38,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:51:38,413 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -857376034, now seen corresponding path program 1 times [2022-11-02 20:51:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:38,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753093889] [2022-11-02 20:51:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,273 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:51:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:39,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753093889] [2022-11-02 20:51:39,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753093889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:39,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:39,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798032080] [2022-11-02 20:51:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:39,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:39,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:39,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:39,278 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 416 [2022-11-02 20:51:39,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 291 transitions, 636 flow. Second operand has 6 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:39,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:39,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 416 [2022-11-02 20:51:39,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:42,230 INFO L130 PetriNetUnfolder]: 7778/11914 cut-off events. [2022-11-02 20:51:42,230 INFO L131 PetriNetUnfolder]: For 4503/4503 co-relation queries the response was YES. [2022-11-02 20:51:42,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27304 conditions, 11914 events. 7778/11914 cut-off events. For 4503/4503 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 67685 event pairs, 4308 based on Foata normal form. 0/11422 useless extension candidates. Maximal degree in co-relation 27207. Up to 8311 conditions per place. [2022-11-02 20:51:42,302 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 108 selfloop transitions, 4 changer transitions 0/338 dead transitions. [2022-11-02 20:51:42,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 338 transitions, 1010 flow [2022-11-02 20:51:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1713 transitions. [2022-11-02 20:51:42,312 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6862980769230769 [2022-11-02 20:51:42,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1713 transitions. [2022-11-02 20:51:42,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1713 transitions. [2022-11-02 20:51:42,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:42,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1713 transitions. [2022-11-02 20:51:42,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.5) internal successors, (1713), 6 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,322 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,323 INFO L175 Difference]: Start difference. First operand has 298 places, 291 transitions, 636 flow. Second operand 6 states and 1713 transitions. [2022-11-02 20:51:42,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 338 transitions, 1010 flow [2022-11-02 20:51:42,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 338 transitions, 1003 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:42,332 INFO L231 Difference]: Finished difference. Result has 298 places, 290 transitions, 635 flow [2022-11-02 20:51:42,332 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=298, PETRI_TRANSITIONS=290} [2022-11-02 20:51:42,333 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:42,333 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 290 transitions, 635 flow [2022-11-02 20:51:42,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:42,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:42,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:51:42,334 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1364484693, now seen corresponding path program 1 times [2022-11-02 20:51:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:42,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207021157] [2022-11-02 20:51:42,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,978 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:51:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:42,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207021157] [2022-11-02 20:51:42,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207021157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:42,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:42,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213416798] [2022-11-02 20:51:42,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:42,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:42,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:42,983 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 416 [2022-11-02 20:51:42,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 290 transitions, 635 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:42,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 416 [2022-11-02 20:51:42,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:45,518 INFO L130 PetriNetUnfolder]: 7615/11800 cut-off events. [2022-11-02 20:51:45,518 INFO L131 PetriNetUnfolder]: For 3953/3953 co-relation queries the response was YES. [2022-11-02 20:51:45,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26357 conditions, 11800 events. 7615/11800 cut-off events. For 3953/3953 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 67775 event pairs, 4950 based on Foata normal form. 0/11302 useless extension candidates. Maximal degree in co-relation 26260. Up to 9472 conditions per place. [2022-11-02 20:51:45,595 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 91 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-02 20:51:45,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 321 transitions, 935 flow [2022-11-02 20:51:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1696 transitions. [2022-11-02 20:51:45,599 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2022-11-02 20:51:45,600 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1696 transitions. [2022-11-02 20:51:45,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1696 transitions. [2022-11-02 20:51:45,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:45,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1696 transitions. [2022-11-02 20:51:45,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 282.6666666666667) internal successors, (1696), 6 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,610 INFO L175 Difference]: Start difference. First operand has 298 places, 290 transitions, 635 flow. Second operand 6 states and 1696 transitions. [2022-11-02 20:51:45,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 321 transitions, 935 flow [2022-11-02 20:51:45,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 321 transitions, 928 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:45,620 INFO L231 Difference]: Finished difference. Result has 298 places, 289 transitions, 634 flow [2022-11-02 20:51:45,620 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=298, PETRI_TRANSITIONS=289} [2022-11-02 20:51:45,621 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:45,621 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 289 transitions, 634 flow [2022-11-02 20:51:45,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:45,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:45,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:51:45,623 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -526550596, now seen corresponding path program 1 times [2022-11-02 20:51:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250066893] [2022-11-02 20:51:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,354 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:51:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250066893] [2022-11-02 20:51:46,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250066893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:46,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:46,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864830465] [2022-11-02 20:51:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:46,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:46,359 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 416 [2022-11-02 20:51:46,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 289 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 274.6666666666667) internal successors, (1648), 6 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:46,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:46,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 416 [2022-11-02 20:51:46,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:49,014 INFO L130 PetriNetUnfolder]: 7744/11930 cut-off events. [2022-11-02 20:51:49,014 INFO L131 PetriNetUnfolder]: For 3949/3949 co-relation queries the response was YES. [2022-11-02 20:51:49,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26570 conditions, 11930 events. 7744/11930 cut-off events. For 3949/3949 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 67883 event pairs, 5163 based on Foata normal form. 0/11493 useless extension candidates. Maximal degree in co-relation 26473. Up to 9905 conditions per place. [2022-11-02 20:51:49,096 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 74 selfloop transitions, 4 changer transitions 0/304 dead transitions. [2022-11-02 20:51:49,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 304 transitions, 844 flow [2022-11-02 20:51:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1683 transitions. [2022-11-02 20:51:49,100 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6742788461538461 [2022-11-02 20:51:49,100 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1683 transitions. [2022-11-02 20:51:49,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1683 transitions. [2022-11-02 20:51:49,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:49,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1683 transitions. [2022-11-02 20:51:49,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,110 INFO L175 Difference]: Start difference. First operand has 298 places, 289 transitions, 634 flow. Second operand 6 states and 1683 transitions. [2022-11-02 20:51:49,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 304 transitions, 844 flow [2022-11-02 20:51:49,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 304 transitions, 837 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:49,117 INFO L231 Difference]: Finished difference. Result has 298 places, 288 transitions, 633 flow [2022-11-02 20:51:49,118 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=298, PETRI_TRANSITIONS=288} [2022-11-02 20:51:49,118 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -87 predicate places. [2022-11-02 20:51:49,119 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 288 transitions, 633 flow [2022-11-02 20:51:49,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.6666666666667) internal successors, (1648), 6 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:49,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:51:49,120 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:51:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash -441564598, now seen corresponding path program 1 times [2022-11-02 20:51:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:49,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073527042] [2022-11-02 20:51:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,219 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:51:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073527042] [2022-11-02 20:51:49,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073527042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:49,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:49,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116530205] [2022-11-02 20:51:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:49,223 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 416 [2022-11-02 20:51:49,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 288 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:49,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 416 [2022-11-02 20:51:49,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:49,816 INFO L130 PetriNetUnfolder]: 1241/3016 cut-off events. [2022-11-02 20:51:49,816 INFO L131 PetriNetUnfolder]: For 719/887 co-relation queries the response was YES. [2022-11-02 20:51:49,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5572 conditions, 3016 events. 1241/3016 cut-off events. For 719/887 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20308 event pairs, 756 based on Foata normal form. 4/2649 useless extension candidates. Maximal degree in co-relation 5528. Up to 1676 conditions per place. [2022-11-02 20:51:49,827 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2022-11-02 20:51:49,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 287 transitions, 689 flow [2022-11-02 20:51:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2022-11-02 20:51:49,832 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7596153846153846 [2022-11-02 20:51:49,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 948 transitions. [2022-11-02 20:51:49,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 948 transitions. [2022-11-02 20:51:49,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:49,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 948 transitions. [2022-11-02 20:51:49,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,840 INFO L175 Difference]: Start difference. First operand has 298 places, 288 transitions, 633 flow. Second operand 3 states and 948 transitions. [2022-11-02 20:51:49,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 287 transitions, 689 flow [2022-11-02 20:51:49,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 287 transitions, 682 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:49,844 INFO L231 Difference]: Finished difference. Result has 295 places, 0 transitions, 0 flow [2022-11-02 20:51:49,845 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=295, PETRI_TRANSITIONS=0} [2022-11-02 20:51:49,845 INFO L287 CegarLoopForPetriNet]: 385 programPoint places, -90 predicate places. [2022-11-02 20:51:49,845 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 0 transitions, 0 flow [2022-11-02 20:51:49,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:49,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (166 of 167 remaining) [2022-11-02 20:51:49,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (165 of 167 remaining) [2022-11-02 20:51:49,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (164 of 167 remaining) [2022-11-02 20:51:49,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (163 of 167 remaining) [2022-11-02 20:51:49,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (162 of 167 remaining) [2022-11-02 20:51:49,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (161 of 167 remaining) [2022-11-02 20:51:49,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (160 of 167 remaining) [2022-11-02 20:51:49,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (159 of 167 remaining) [2022-11-02 20:51:49,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (158 of 167 remaining) [2022-11-02 20:51:49,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (157 of 167 remaining) [2022-11-02 20:51:49,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (156 of 167 remaining) [2022-11-02 20:51:49,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (155 of 167 remaining) [2022-11-02 20:51:49,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (154 of 167 remaining) [2022-11-02 20:51:49,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (153 of 167 remaining) [2022-11-02 20:51:49,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (152 of 167 remaining) [2022-11-02 20:51:49,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (151 of 167 remaining) [2022-11-02 20:51:49,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (150 of 167 remaining) [2022-11-02 20:51:49,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (149 of 167 remaining) [2022-11-02 20:51:49,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (148 of 167 remaining) [2022-11-02 20:51:49,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (147 of 167 remaining) [2022-11-02 20:51:49,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (146 of 167 remaining) [2022-11-02 20:51:49,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (145 of 167 remaining) [2022-11-02 20:51:49,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (144 of 167 remaining) [2022-11-02 20:51:49,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (143 of 167 remaining) [2022-11-02 20:51:49,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (142 of 167 remaining) [2022-11-02 20:51:49,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (141 of 167 remaining) [2022-11-02 20:51:49,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (140 of 167 remaining) [2022-11-02 20:51:49,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (139 of 167 remaining) [2022-11-02 20:51:49,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (138 of 167 remaining) [2022-11-02 20:51:49,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (137 of 167 remaining) [2022-11-02 20:51:49,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (136 of 167 remaining) [2022-11-02 20:51:49,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (135 of 167 remaining) [2022-11-02 20:51:49,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (134 of 167 remaining) [2022-11-02 20:51:49,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (133 of 167 remaining) [2022-11-02 20:51:49,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (132 of 167 remaining) [2022-11-02 20:51:49,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (131 of 167 remaining) [2022-11-02 20:51:49,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (130 of 167 remaining) [2022-11-02 20:51:49,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (129 of 167 remaining) [2022-11-02 20:51:49,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (128 of 167 remaining) [2022-11-02 20:51:49,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 167 remaining) [2022-11-02 20:51:49,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (126 of 167 remaining) [2022-11-02 20:51:49,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (125 of 167 remaining) [2022-11-02 20:51:49,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (124 of 167 remaining) [2022-11-02 20:51:49,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (123 of 167 remaining) [2022-11-02 20:51:49,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (122 of 167 remaining) [2022-11-02 20:51:49,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (121 of 167 remaining) [2022-11-02 20:51:49,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (120 of 167 remaining) [2022-11-02 20:51:49,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (119 of 167 remaining) [2022-11-02 20:51:49,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (118 of 167 remaining) [2022-11-02 20:51:49,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (117 of 167 remaining) [2022-11-02 20:51:49,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (116 of 167 remaining) [2022-11-02 20:51:49,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (115 of 167 remaining) [2022-11-02 20:51:49,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (114 of 167 remaining) [2022-11-02 20:51:49,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (113 of 167 remaining) [2022-11-02 20:51:49,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (112 of 167 remaining) [2022-11-02 20:51:49,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (111 of 167 remaining) [2022-11-02 20:51:49,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (110 of 167 remaining) [2022-11-02 20:51:49,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (109 of 167 remaining) [2022-11-02 20:51:49,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (108 of 167 remaining) [2022-11-02 20:51:49,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (107 of 167 remaining) [2022-11-02 20:51:49,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (106 of 167 remaining) [2022-11-02 20:51:49,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (105 of 167 remaining) [2022-11-02 20:51:49,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (104 of 167 remaining) [2022-11-02 20:51:49,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (103 of 167 remaining) [2022-11-02 20:51:49,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (102 of 167 remaining) [2022-11-02 20:51:49,861 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (101 of 167 remaining) [2022-11-02 20:51:49,861 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (100 of 167 remaining) [2022-11-02 20:51:49,861 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (99 of 167 remaining) [2022-11-02 20:51:49,863 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (98 of 167 remaining) [2022-11-02 20:51:49,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (97 of 167 remaining) [2022-11-02 20:51:49,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (96 of 167 remaining) [2022-11-02 20:51:49,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (95 of 167 remaining) [2022-11-02 20:51:49,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (94 of 167 remaining) [2022-11-02 20:51:49,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 167 remaining) [2022-11-02 20:51:49,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 167 remaining) [2022-11-02 20:51:49,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 167 remaining) [2022-11-02 20:51:49,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 167 remaining) [2022-11-02 20:51:49,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 167 remaining) [2022-11-02 20:51:49,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 167 remaining) [2022-11-02 20:51:49,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 167 remaining) [2022-11-02 20:51:49,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 167 remaining) [2022-11-02 20:51:49,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 167 remaining) [2022-11-02 20:51:49,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 167 remaining) [2022-11-02 20:51:49,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 167 remaining) [2022-11-02 20:51:49,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 167 remaining) [2022-11-02 20:51:49,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 167 remaining) [2022-11-02 20:51:49,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 167 remaining) [2022-11-02 20:51:49,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 167 remaining) [2022-11-02 20:51:49,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 167 remaining) [2022-11-02 20:51:49,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 167 remaining) [2022-11-02 20:51:49,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 167 remaining) [2022-11-02 20:51:49,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 167 remaining) [2022-11-02 20:51:49,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 167 remaining) [2022-11-02 20:51:49,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 167 remaining) [2022-11-02 20:51:49,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 167 remaining) [2022-11-02 20:51:49,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 167 remaining) [2022-11-02 20:51:49,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 167 remaining) [2022-11-02 20:51:49,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 167 remaining) [2022-11-02 20:51:49,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 167 remaining) [2022-11-02 20:51:49,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 167 remaining) [2022-11-02 20:51:49,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 167 remaining) [2022-11-02 20:51:49,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 167 remaining) [2022-11-02 20:51:49,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 167 remaining) [2022-11-02 20:51:49,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 167 remaining) [2022-11-02 20:51:49,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 167 remaining) [2022-11-02 20:51:49,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 167 remaining) [2022-11-02 20:51:49,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 167 remaining) [2022-11-02 20:51:49,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 167 remaining) [2022-11-02 20:51:49,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 167 remaining) [2022-11-02 20:51:49,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 167 remaining) [2022-11-02 20:51:49,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 167 remaining) [2022-11-02 20:51:49,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 167 remaining) [2022-11-02 20:51:49,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 167 remaining) [2022-11-02 20:51:49,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 167 remaining) [2022-11-02 20:51:49,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 167 remaining) [2022-11-02 20:51:49,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 167 remaining) [2022-11-02 20:51:49,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 167 remaining) [2022-11-02 20:51:49,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 167 remaining) [2022-11-02 20:51:49,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 167 remaining) [2022-11-02 20:51:49,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 167 remaining) [2022-11-02 20:51:49,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 167 remaining) [2022-11-02 20:51:49,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 167 remaining) [2022-11-02 20:51:49,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 167 remaining) [2022-11-02 20:51:49,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 167 remaining) [2022-11-02 20:51:49,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 167 remaining) [2022-11-02 20:51:49,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 167 remaining) [2022-11-02 20:51:49,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 167 remaining) [2022-11-02 20:51:49,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 167 remaining) [2022-11-02 20:51:49,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 167 remaining) [2022-11-02 20:51:49,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 167 remaining) [2022-11-02 20:51:49,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 167 remaining) [2022-11-02 20:51:49,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 167 remaining) [2022-11-02 20:51:49,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 167 remaining) [2022-11-02 20:51:49,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 167 remaining) [2022-11-02 20:51:49,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 167 remaining) [2022-11-02 20:51:49,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 167 remaining) [2022-11-02 20:51:49,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 167 remaining) [2022-11-02 20:51:49,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 167 remaining) [2022-11-02 20:51:49,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 167 remaining) [2022-11-02 20:51:49,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 167 remaining) [2022-11-02 20:51:49,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 167 remaining) [2022-11-02 20:51:49,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 167 remaining) [2022-11-02 20:51:49,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 167 remaining) [2022-11-02 20:51:49,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 167 remaining) [2022-11-02 20:51:49,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 167 remaining) [2022-11-02 20:51:49,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 167 remaining) [2022-11-02 20:51:49,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 167 remaining) [2022-11-02 20:51:49,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 167 remaining) [2022-11-02 20:51:49,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 167 remaining) [2022-11-02 20:51:49,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 167 remaining) [2022-11-02 20:51:49,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 167 remaining) [2022-11-02 20:51:49,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 167 remaining) [2022-11-02 20:51:49,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 167 remaining) [2022-11-02 20:51:49,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 167 remaining) [2022-11-02 20:51:49,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 167 remaining) [2022-11-02 20:51:49,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 167 remaining) [2022-11-02 20:51:49,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 167 remaining) [2022-11-02 20:51:49,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 167 remaining) [2022-11-02 20:51:49,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 167 remaining) [2022-11-02 20:51:49,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 167 remaining) [2022-11-02 20:51:49,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 167 remaining) [2022-11-02 20:51:49,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 167 remaining) [2022-11-02 20:51:49,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 167 remaining) [2022-11-02 20:51:49,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 167 remaining) [2022-11-02 20:51:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 167 remaining) [2022-11-02 20:51:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 167 remaining) [2022-11-02 20:51:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 167 remaining) [2022-11-02 20:51:49,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:51:49,883 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:49,893 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:51:49,893 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:51:49,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:51:49 BasicIcfg [2022-11-02 20:51:49,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:51:49,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:51:49,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:51:49,900 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:51:49,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:14" (3/4) ... [2022-11-02 20:51:49,904 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:51:49,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:51:49,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:51:49,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:51:49,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:51:49,919 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-02 20:51:49,919 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:51:49,920 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:51:49,920 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:51:49,998 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:51:49,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:51:49,999 INFO L158 Benchmark]: Toolchain (without parser) took 38044.14ms. Allocated memory was 117.4MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 53.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:51:50,000 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:51:50,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.43ms. Allocated memory is still 117.4MB. Free memory was 53.8MB in the beginning and 89.6MB in the end (delta: -35.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-11-02 20:51:50,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.00ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 85.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:51:50,001 INFO L158 Benchmark]: Boogie Preprocessor took 110.86ms. Allocated memory is still 117.4MB. Free memory was 85.5MB in the beginning and 82.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:50,002 INFO L158 Benchmark]: RCFGBuilder took 1826.60ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 81.8MB in the beginning and 72.5MB in the end (delta: 9.3MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2022-11-02 20:51:50,002 INFO L158 Benchmark]: TraceAbstraction took 35536.44ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 72.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:51:50,003 INFO L158 Benchmark]: Witness Printer took 98.66ms. Allocated memory is still 3.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:51:50,005 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.31ms. Allocated memory is still 117.4MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.43ms. Allocated memory is still 117.4MB. Free memory was 53.8MB in the beginning and 89.6MB in the end (delta: -35.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.00ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 85.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.86ms. Allocated memory is still 117.4MB. Free memory was 85.5MB in the beginning and 82.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1826.60ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 81.8MB in the beginning and 72.5MB in the end (delta: 9.3MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35536.44ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 72.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 98.66ms. Allocated memory is still 3.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 79]: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: 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: 95]: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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 9 procedures, 502 locations, 167 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1587 IncrementalHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 215 mSDtfsCounter, 1587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=0, InterpolantAutomatonStates: 81, 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, 4.0s InterpolantComputationTime, 2591 NumberOfCodeBlocks, 2591 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 3042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 93 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:51:50,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6294bc8b-5707-4275-a073-85a2816a2251/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE