./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i --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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/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 dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec --- 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:38:37,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:38:37,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:38:37,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:38:37,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:38:37,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:38:37,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:38:37,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:38:37,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:38:37,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:38:37,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:38:37,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:38:37,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:38:37,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:38:37,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:38:37,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:38:37,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:38:37,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:38:37,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:38:37,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:38:37,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:38:37,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:38:37,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:38:37,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:38:37,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:38:37,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:38:37,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:38:37,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:38:37,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:38:37,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:38:37,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:38:37,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:38:37,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:38:37,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:38:37,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:38:37,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:38:37,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:38:37,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:38:37,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:38:37,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:38:37,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:38:37,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:38:37,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:38:37,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:38:37,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:38:37,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:38:37,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:38:37,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:38:37,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:38:37,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:38:37,327 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:38:37,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:38:37,327 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:38:37,327 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:38:37,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:38:37,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:38:37,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:38:37,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:38:37,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:38:37,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:38:37,329 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:38:37,329 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:38:37,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:38:37,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:38:37,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:38:37,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:38:37,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:38:37,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:38:37,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:38:37,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:38:37,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:38:37,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:38:37,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:38:37,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:38:37,332 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:38:37,333 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:38:37,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:38:37,333 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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/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 -> dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec [2022-11-02 20:38:37,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:38:37,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:38:37,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:38:37,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:38:37,686 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:38:37,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2022-11-02 20:38:37,786 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/data/80f570f58/664c013439f548998b7aa470174899c5/FLAGbe209b8c3 [2022-11-02 20:38:38,334 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:38:38,335 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2022-11-02 20:38:38,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/data/80f570f58/664c013439f548998b7aa470174899c5/FLAGbe209b8c3 [2022-11-02 20:38:38,651 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/data/80f570f58/664c013439f548998b7aa470174899c5 [2022-11-02 20:38:38,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:38:38,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:38:38,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:38:38,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:38:38,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:38:38,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:38:38" (1/1) ... [2022-11-02 20:38:38,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4685f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:38, skipping insertion in model container [2022-11-02 20:38:38,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:38:38" (1/1) ... [2022-11-02 20:38:38,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:38:38,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:38:39,291 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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i[30035,30048] [2022-11-02 20:38:39,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:38:39,342 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:38:39,397 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_7c4c65ba-9de6-46ef-9903-ebb2354e3525/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i[30035,30048] [2022-11-02 20:38:39,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:38:39,457 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:38:39,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39 WrapperNode [2022-11-02 20:38:39,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:38:39,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:38:39,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:38:39,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:38:39,473 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:38:39" (1/1) ... [2022-11-02 20:38:39,499 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:38:39" (1/1) ... [2022-11-02 20:38:39,533 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-02 20:38:39,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:38:39,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:38:39,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:38:39,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:38:39,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,577 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:38:39,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:38:39,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:38:39,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:38:39,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (1/1) ... [2022-11-02 20:38:39,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:38:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:39,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:38:39,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:38:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-02 20:38:39,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-02 20:38:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 20:38:39,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 20:38:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:38:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:38:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:38:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:38:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:38:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:38:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:38:39,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:38:39,685 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:38:39,924 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:38:39,926 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:38:40,283 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:38:40,292 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:38:40,293 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:38:40,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:38:40 BoogieIcfgContainer [2022-11-02 20:38:40,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:38:40,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:38:40,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:38:40,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:38:40,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:38:38" (1/3) ... [2022-11-02 20:38:40,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4605ce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:38:40, skipping insertion in model container [2022-11-02 20:38:40,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:38:39" (2/3) ... [2022-11-02 20:38:40,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4605ce43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:38:40, skipping insertion in model container [2022-11-02 20:38:40,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:38:40" (3/3) ... [2022-11-02 20:38:40,305 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2022-11-02 20:38:40,314 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:38:40,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:38:40,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-02 20:38:40,327 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:38:40,429 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:38:40,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 138 transitions, 286 flow [2022-11-02 20:38:40,595 INFO L130 PetriNetUnfolder]: 7/154 cut-off events. [2022-11-02 20:38:40,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:38:40,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 154 events. 7/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2022-11-02 20:38:40,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 138 transitions, 286 flow [2022-11-02 20:38:40,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 282 flow [2022-11-02 20:38:40,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:38:40,642 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;@60326444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:38:40,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-02 20:38:40,662 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-02 20:38:40,663 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:38:40,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:40,664 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] [2022-11-02 20:38:40,664 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-02 20:38:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2090519078, now seen corresponding path program 1 times [2022-11-02 20:38:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:40,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418596701] [2022-11-02 20:38:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:41,012 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:38:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418596701] [2022-11-02 20:38:41,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418596701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:41,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:41,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914182662] [2022-11-02 20:38:41,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:41,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:41,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:41,084 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2022-11-02 20:38:41,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:41,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2022-11-02 20:38:41,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:41,210 INFO L130 PetriNetUnfolder]: 26/244 cut-off events. [2022-11-02 20:38:41,210 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:38:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 244 events. 26/244 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 695 event pairs, 21 based on Foata normal form. 36/234 useless extension candidates. Maximal degree in co-relation 245. Up to 57 conditions per place. [2022-11-02 20:38:41,214 INFO L137 encePairwiseOnDemand]: 131/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/131 dead transitions. [2022-11-02 20:38:41,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 302 flow [2022-11-02 20:38:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-11-02 20:38:41,228 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8913043478260869 [2022-11-02 20:38:41,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-11-02 20:38:41,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-11-02 20:38:41,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:41,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-11-02 20:38:41,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,266 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 282 flow. Second operand 3 states and 369 transitions. [2022-11-02 20:38:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 302 flow [2022-11-02 20:38:41,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:38:41,289 INFO L231 Difference]: Finished difference. Result has 136 places, 130 transitions, 271 flow [2022-11-02 20:38:41,291 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=136, PETRI_TRANSITIONS=130} [2022-11-02 20:38:41,295 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-11-02 20:38:41,295 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 130 transitions, 271 flow [2022-11-02 20:38:41,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:41,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:41,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:38:41,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-02 20:38:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -907298788, now seen corresponding path program 1 times [2022-11-02 20:38:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:41,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305091850] [2022-11-02 20:38:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:41,432 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:38:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:41,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305091850] [2022-11-02 20:38:41,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305091850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:41,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:41,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747042192] [2022-11-02 20:38:41,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:41,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:41,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:41,443 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-11-02 20:38:41,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 130 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:41,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-11-02 20:38:41,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:41,650 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2022-11-02 20:38:41,650 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:38:41,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 619 events. 110/619 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3429 event pairs, 93 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 785. Up to 183 conditions per place. [2022-11-02 20:38:41,661 INFO L137 encePairwiseOnDemand]: 135/138 looper letters, 20 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2022-11-02 20:38:41,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 129 transitions, 313 flow [2022-11-02 20:38:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-11-02 20:38:41,670 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2022-11-02 20:38:41,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2022-11-02 20:38:41,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2022-11-02 20:38:41,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:41,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2022-11-02 20:38:41,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,678 INFO L175 Difference]: Start difference. First operand has 136 places, 130 transitions, 271 flow. Second operand 3 states and 353 transitions. [2022-11-02 20:38:41,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 129 transitions, 313 flow [2022-11-02 20:38:41,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:41,685 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 269 flow [2022-11-02 20:38:41,685 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2022-11-02 20:38:41,686 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -3 predicate places. [2022-11-02 20:38:41,686 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 269 flow [2022-11-02 20:38:41,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:41,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:41,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:38:41,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-02 20:38:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash -10396590, now seen corresponding path program 1 times [2022-11-02 20:38:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:41,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770194993] [2022-11-02 20:38:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:41,777 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:38:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770194993] [2022-11-02 20:38:41,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770194993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:41,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:41,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:41,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303196666] [2022-11-02 20:38:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:41,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:41,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:41,781 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-11-02 20:38:41,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:41,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-11-02 20:38:41,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:41,903 INFO L130 PetriNetUnfolder]: 44/420 cut-off events. [2022-11-02 20:38:41,904 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:38:41,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 420 events. 44/420 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1915 event pairs, 34 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 469. Up to 74 conditions per place. [2022-11-02 20:38:41,907 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 1 changer transitions 0/124 dead transitions. [2022-11-02 20:38:41,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 287 flow [2022-11-02 20:38:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-11-02 20:38:41,911 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8647342995169082 [2022-11-02 20:38:41,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2022-11-02 20:38:41,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2022-11-02 20:38:41,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:41,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2022-11-02 20:38:41,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,917 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 269 flow. Second operand 3 states and 358 transitions. [2022-11-02 20:38:41,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 287 flow [2022-11-02 20:38:41,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:41,921 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 257 flow [2022-11-02 20:38:41,921 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2022-11-02 20:38:41,924 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -8 predicate places. [2022-11-02 20:38:41,924 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 257 flow [2022-11-02 20:38:41,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:41,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:41,925 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:38:41,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:38:41,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-02 20:38:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash -10200230, now seen corresponding path program 1 times [2022-11-02 20:38:41,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:41,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901773322] [2022-11-02 20:38:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:42,064 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:38:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:42,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901773322] [2022-11-02 20:38:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901773322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:42,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348293750] [2022-11-02 20:38:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:42,072 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 138 [2022-11-02 20:38:42,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:42,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 138 [2022-11-02 20:38:42,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:42,161 INFO L130 PetriNetUnfolder]: 16/249 cut-off events. [2022-11-02 20:38:42,161 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:38:42,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 249 events. 16/249 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 649 event pairs, 4 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 265. Up to 29 conditions per place. [2022-11-02 20:38:42,165 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2022-11-02 20:38:42,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 306 flow [2022-11-02 20:38:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-11-02 20:38:42,168 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9106280193236715 [2022-11-02 20:38:42,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2022-11-02 20:38:42,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2022-11-02 20:38:42,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:42,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2022-11-02 20:38:42,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,176 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 257 flow. Second operand 3 states and 377 transitions. [2022-11-02 20:38:42,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 306 flow [2022-11-02 20:38:42,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:38:42,182 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 284 flow [2022-11-02 20:38:42,183 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2022-11-02 20:38:42,184 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -6 predicate places. [2022-11-02 20:38:42,185 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 284 flow [2022-11-02 20:38:42,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:42,193 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:38:42,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-02 20:38:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1135106733, now seen corresponding path program 1 times [2022-11-02 20:38:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:42,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628829207] [2022-11-02 20:38:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:38:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628829207] [2022-11-02 20:38:42,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628829207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:42,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:42,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:38:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738503695] [2022-11-02 20:38:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:42,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:38:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:38:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:38:42,344 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2022-11-02 20:38:42,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:42,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2022-11-02 20:38:42,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:42,449 INFO L130 PetriNetUnfolder]: 3/193 cut-off events. [2022-11-02 20:38:42,449 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:38:42,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 193 events. 3/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 350 event pairs, 1 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 195. Up to 12 conditions per place. [2022-11-02 20:38:42,451 INFO L137 encePairwiseOnDemand]: 134/138 looper letters, 11 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2022-11-02 20:38:42,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 320 flow [2022-11-02 20:38:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:38:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:38:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-11-02 20:38:42,453 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2022-11-02 20:38:42,453 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2022-11-02 20:38:42,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2022-11-02 20:38:42,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:42,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2022-11-02 20:38:42,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,459 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,459 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 284 flow. Second operand 5 states and 616 transitions. [2022-11-02 20:38:42,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 320 flow [2022-11-02 20:38:42,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 129 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:42,463 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 280 flow [2022-11-02 20:38:42,463 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2022-11-02 20:38:42,464 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-11-02 20:38:42,464 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 280 flow [2022-11-02 20:38:42,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:42,465 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:38:42,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-02 20:38:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1692640194, now seen corresponding path program 1 times [2022-11-02 20:38:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565001122] [2022-11-02 20:38:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:38:42,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:38:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:38:42,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:38:42,654 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:38:42,655 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2022-11-02 20:38:42,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2022-11-02 20:38:42,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2022-11-02 20:38:42,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2022-11-02 20:38:42,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2022-11-02 20:38:42,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2022-11-02 20:38:42,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2022-11-02 20:38:42,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2022-11-02 20:38:42,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2022-11-02 20:38:42,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2022-11-02 20:38:42,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2022-11-02 20:38:42,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2022-11-02 20:38:42,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2022-11-02 20:38:42,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2022-11-02 20:38:42,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2022-11-02 20:38:42,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2022-11-02 20:38:42,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2022-11-02 20:38:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:38:42,672 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-02 20:38:42,675 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:38:42,676 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 20:38:42,732 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:38:42,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 188 transitions, 400 flow [2022-11-02 20:38:42,769 INFO L130 PetriNetUnfolder]: 10/208 cut-off events. [2022-11-02 20:38:42,769 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:38:42,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 208 events. 10/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 217. Up to 6 conditions per place. [2022-11-02 20:38:42,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 188 transitions, 400 flow [2022-11-02 20:38:42,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 353 flow [2022-11-02 20:38:42,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:38:42,776 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;@60326444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:38:42,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-02 20:38:42,780 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-02 20:38:42,780 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:38:42,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:42,781 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] [2022-11-02 20:38:42,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1825814106, now seen corresponding path program 1 times [2022-11-02 20:38:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:42,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400181176] [2022-11-02 20:38:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:42,823 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:38:42,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:42,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400181176] [2022-11-02 20:38:42,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400181176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:42,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:42,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995001711] [2022-11-02 20:38:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:42,830 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 188 [2022-11-02 20:38:42,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:42,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:42,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 188 [2022-11-02 20:38:42,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:43,159 INFO L130 PetriNetUnfolder]: 377/1347 cut-off events. [2022-11-02 20:38:43,160 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-02 20:38:43,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 1347 events. 377/1347 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8968 event pairs, 336 based on Foata normal form. 307/1321 useless extension candidates. Maximal degree in co-relation 1952. Up to 568 conditions per place. [2022-11-02 20:38:43,185 INFO L137 encePairwiseOnDemand]: 180/188 looper letters, 21 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2022-11-02 20:38:43,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 385 flow [2022-11-02 20:38:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-11-02 20:38:43,187 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8599290780141844 [2022-11-02 20:38:43,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-11-02 20:38:43,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-11-02 20:38:43,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:43,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-11-02 20:38:43,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,193 INFO L175 Difference]: Start difference. First operand has 169 places, 169 transitions, 353 flow. Second operand 3 states and 485 transitions. [2022-11-02 20:38:43,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 385 flow [2022-11-02 20:38:43,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 382 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 20:38:43,197 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2022-11-02 20:38:43,197 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2022-11-02 20:38:43,199 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -1 predicate places. [2022-11-02 20:38:43,199 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2022-11-02 20:38:43,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:43,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:43,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:38:43,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash -424994472, now seen corresponding path program 1 times [2022-11-02 20:38:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:43,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500722069] [2022-11-02 20:38:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:43,278 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:38:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:43,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500722069] [2022-11-02 20:38:43,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500722069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:43,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:43,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229974383] [2022-11-02 20:38:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:43,281 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 188 [2022-11-02 20:38:43,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:43,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 188 [2022-11-02 20:38:43,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:43,756 INFO L130 PetriNetUnfolder]: 734/2801 cut-off events. [2022-11-02 20:38:43,756 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-02 20:38:43,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 2801 events. 734/2801 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 23364 event pairs, 621 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3811. Up to 967 conditions per place. [2022-11-02 20:38:43,841 INFO L137 encePairwiseOnDemand]: 185/188 looper letters, 24 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2022-11-02 20:38:43,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 388 flow [2022-11-02 20:38:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2022-11-02 20:38:43,843 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8404255319148937 [2022-11-02 20:38:43,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2022-11-02 20:38:43,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2022-11-02 20:38:43,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:43,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2022-11-02 20:38:43,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,846 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 474 transitions. [2022-11-02 20:38:43,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 388 flow [2022-11-02 20:38:43,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:43,850 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2022-11-02 20:38:43,851 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-11-02 20:38:43,851 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2022-11-02 20:38:43,851 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2022-11-02 20:38:43,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:43,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:43,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:38:43,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -13758834, now seen corresponding path program 1 times [2022-11-02 20:38:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:43,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252441652] [2022-11-02 20:38:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:43,883 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:38:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:43,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252441652] [2022-11-02 20:38:43,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252441652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:43,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:43,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490068020] [2022-11-02 20:38:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:43,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:43,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:43,887 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 188 [2022-11-02 20:38:43,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:43,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:43,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 188 [2022-11-02 20:38:43,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:44,126 INFO L130 PetriNetUnfolder]: 233/1396 cut-off events. [2022-11-02 20:38:44,126 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-02 20:38:44,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 1396 events. 233/1396 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10093 event pairs, 178 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 1705. Up to 299 conditions per place. [2022-11-02 20:38:44,145 INFO L137 encePairwiseOnDemand]: 181/188 looper letters, 16 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2022-11-02 20:38:44,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 358 flow [2022-11-02 20:38:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-11-02 20:38:44,147 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.849290780141844 [2022-11-02 20:38:44,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2022-11-02 20:38:44,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2022-11-02 20:38:44,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:44,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2022-11-02 20:38:44,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,151 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 479 transitions. [2022-11-02 20:38:44,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 358 flow [2022-11-02 20:38:44,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:44,157 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2022-11-02 20:38:44,157 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2022-11-02 20:38:44,160 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2022-11-02 20:38:44,160 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2022-11-02 20:38:44,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:44,161 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:38:44,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:38:44,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1264049558, now seen corresponding path program 1 times [2022-11-02 20:38:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:44,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307778112] [2022-11-02 20:38:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:44,211 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:38:44,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:44,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307778112] [2022-11-02 20:38:44,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307778112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:44,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:44,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036601121] [2022-11-02 20:38:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:44,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:44,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:44,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:44,214 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 188 [2022-11-02 20:38:44,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:44,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 188 [2022-11-02 20:38:44,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:44,620 INFO L130 PetriNetUnfolder]: 350/1791 cut-off events. [2022-11-02 20:38:44,621 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-02 20:38:44,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 1791 events. 350/1791 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13592 event pairs, 121 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 2477. Up to 364 conditions per place. [2022-11-02 20:38:44,649 INFO L137 encePairwiseOnDemand]: 177/188 looper letters, 26 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2022-11-02 20:38:44,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 426 flow [2022-11-02 20:38:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-02 20:38:44,651 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2022-11-02 20:38:44,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-02 20:38:44,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-02 20:38:44,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:44,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-02 20:38:44,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,655 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 502 transitions. [2022-11-02 20:38:44,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 426 flow [2022-11-02 20:38:44,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:38:44,660 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2022-11-02 20:38:44,660 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2022-11-02 20:38:44,661 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -6 predicate places. [2022-11-02 20:38:44,661 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2022-11-02 20:38:44,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:44,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:44,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:38:44,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2096221313, now seen corresponding path program 1 times [2022-11-02 20:38:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:44,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92569713] [2022-11-02 20:38:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:44,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:44,726 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:38:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:44,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92569713] [2022-11-02 20:38:44,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92569713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:44,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939871431] [2022-11-02 20:38:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:44,729 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 188 [2022-11-02 20:38:44,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:44,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:44,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 188 [2022-11-02 20:38:44,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:45,182 INFO L130 PetriNetUnfolder]: 526/1995 cut-off events. [2022-11-02 20:38:45,182 INFO L131 PetriNetUnfolder]: For 701/836 co-relation queries the response was YES. [2022-11-02 20:38:45,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 1995 events. 526/1995 cut-off events. For 701/836 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15207 event pairs, 205 based on Foata normal form. 3/1779 useless extension candidates. Maximal degree in co-relation 3680. Up to 702 conditions per place. [2022-11-02 20:38:45,215 INFO L137 encePairwiseOnDemand]: 181/188 looper letters, 37 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2022-11-02 20:38:45,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 558 flow [2022-11-02 20:38:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-11-02 20:38:45,218 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2022-11-02 20:38:45,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-11-02 20:38:45,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-11-02 20:38:45,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:45,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-11-02 20:38:45,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,223 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 494 transitions. [2022-11-02 20:38:45,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 558 flow [2022-11-02 20:38:45,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 179 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:45,231 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2022-11-02 20:38:45,232 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2022-11-02 20:38:45,233 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -4 predicate places. [2022-11-02 20:38:45,233 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2022-11-02 20:38:45,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:45,234 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] [2022-11-02 20:38:45,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:38:45,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1978733824, now seen corresponding path program 1 times [2022-11-02 20:38:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799653347] [2022-11-02 20:38:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:45,385 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:38:45,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:45,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799653347] [2022-11-02 20:38:45,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799653347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:45,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:45,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:38:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892077607] [2022-11-02 20:38:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:45,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:38:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:45,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:38:45,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:38:45,390 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2022-11-02 20:38:45,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:45,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2022-11-02 20:38:45,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:45,646 INFO L130 PetriNetUnfolder]: 154/1067 cut-off events. [2022-11-02 20:38:45,647 INFO L131 PetriNetUnfolder]: For 230/451 co-relation queries the response was YES. [2022-11-02 20:38:45,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 1067 events. 154/1067 cut-off events. For 230/451 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7493 event pairs, 33 based on Foata normal form. 1/929 useless extension candidates. Maximal degree in co-relation 1619. Up to 172 conditions per place. [2022-11-02 20:38:45,661 INFO L137 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2022-11-02 20:38:45,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 499 flow [2022-11-02 20:38:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:38:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:38:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2022-11-02 20:38:45,670 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8957446808510638 [2022-11-02 20:38:45,670 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2022-11-02 20:38:45,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2022-11-02 20:38:45,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:45,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2022-11-02 20:38:45,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,677 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 842 transitions. [2022-11-02 20:38:45,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 499 flow [2022-11-02 20:38:45,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:45,684 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2022-11-02 20:38:45,684 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2022-11-02 20:38:45,685 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2022-11-02 20:38:45,685 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2022-11-02 20:38:45,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:45,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:45,686 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] [2022-11-02 20:38:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:38:45,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-11-02 20:38:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1181173309, now seen corresponding path program 1 times [2022-11-02 20:38:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:45,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314903350] [2022-11-02 20:38:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:38:45,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:38:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:38:45,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:38:45,752 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:38:45,753 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-02 20:38:45,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-02 20:38:45,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-02 20:38:45,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-02 20:38:45,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-02 20:38:45,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-02 20:38:45,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-02 20:38:45,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-02 20:38:45,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-02 20:38:45,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-02 20:38:45,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2022-11-02 20:38:45,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2022-11-02 20:38:45,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2022-11-02 20:38:45,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-02 20:38:45,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-02 20:38:45,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-02 20:38:45,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-02 20:38:45,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-02 20:38:45,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-02 20:38:45,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-02 20:38:45,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-02 20:38:45,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-02 20:38:45,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:38:45,758 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:45,764 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-11-02 20:38:45,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:38:45,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:38:45 BasicIcfg [2022-11-02 20:38:45,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:38:45,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:38:45,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:38:45,885 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:38:45,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:38:40" (3/4) ... [2022-11-02 20:38:45,889 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:38:45,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:38:45,890 INFO L158 Benchmark]: Toolchain (without parser) took 7228.59ms. Allocated memory was 155.2MB in the beginning and 314.6MB in the end (delta: 159.4MB). Free memory was 114.3MB in the beginning and 191.2MB in the end (delta: -76.9MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:45,891 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 155.2MB. Free memory was 125.3MB in the beginning and 125.3MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:38:45,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 796.11ms. Allocated memory is still 155.2MB. Free memory was 114.1MB in the beginning and 116.7MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:38:45,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.69ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:45,892 INFO L158 Benchmark]: Boogie Preprocessor took 46.54ms. Allocated memory is still 155.2MB. Free memory was 114.6MB in the beginning and 112.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:45,893 INFO L158 Benchmark]: RCFGBuilder took 713.59ms. Allocated memory is still 155.2MB. Free memory was 112.5MB in the beginning and 96.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:38:45,893 INFO L158 Benchmark]: TraceAbstraction took 5586.20ms. Allocated memory was 155.2MB in the beginning and 314.6MB in the end (delta: 159.4MB). Free memory was 96.5MB in the beginning and 191.2MB in the end (delta: -94.6MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-11-02 20:38:45,893 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 314.6MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:38:45,895 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.27ms. Allocated memory is still 155.2MB. Free memory was 125.3MB in the beginning and 125.3MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 796.11ms. Allocated memory is still 155.2MB. Free memory was 114.1MB in the beginning and 116.7MB in the end (delta: -2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.69ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.54ms. Allocated memory is still 155.2MB. Free memory was 114.6MB in the beginning and 112.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.59ms. Allocated memory is still 155.2MB. Free memory was 112.5MB in the beginning and 96.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5586.20ms. Allocated memory was 155.2MB in the beginning and 314.6MB in the end (delta: 159.4MB). Free memory was 96.5MB in the beginning and 191.2MB in the end (delta: -94.6MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 314.6MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L709] 0 x = 0 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=54, __VERIFIER_nondet_uint()=7, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=7, n = __VERIFIER_nondet_uint()=51, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=7, n >= (10/2) && n < 10=1, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n < 10 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=7, n >= (10/2) && n < 10=1, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=7, n >= (10/2) && n < 10=1, t1={6:0}, t2={5:0}, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n < 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n < 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=7, pthread_create(&t1, 0, thr1, 0)=10, t1={6:0}, t2={5:0}, x=0] [L694] 1 x <= n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L713] 0 int i = 0; VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L713] 0 i < n VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=7, pthread_create(&t2, 0, thr2, 0)=11, t1={6:0}, t2={5:0}, x=0] [L697] 2 int t; VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=7, arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, \old(cond)=1, cond=1, cond=1, mut={3:0}, n=7, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] 2 k == n VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] COND TRUE 2 k == n VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L703] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=1, x = t + 1=50] [L694] 1 x <= n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=7, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x <= n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 181 locations, 17 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: 2.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 57 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=4, InterpolantAutomatonStates: 17, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 228 locations, 22 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: 3.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 93 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:38:46,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c4c65ba-9de6-46ef-9903-ebb2354e3525/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE