./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/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_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/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_39c21383-fc0d-43bf-98c9-b33dda999f7f/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 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:10:34,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:10:34,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:10:34,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:10:34,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:10:34,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:10:34,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:10:34,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:10:34,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:10:34,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:10:34,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:10:34,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:10:34,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:10:34,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:10:34,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:10:34,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:10:34,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:10:34,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:10:34,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:10:34,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:10:34,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:10:34,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:10:34,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:10:34,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:10:34,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:10:34,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:10:34,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:10:34,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:10:34,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:10:34,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:10:34,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:10:34,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:10:34,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:10:34,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:10:34,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:10:34,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:10:34,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:10:34,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:10:34,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:10:34,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:10:34,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:10:34,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 21:10:34,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:10:34,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:10:34,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:10:34,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:10:34,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:10:34,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:10:34,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:10:34,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:10:34,307 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:10:34,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:10:34,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:10:34,309 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:10:34,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:10:34,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:10:34,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:10:34,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:10:34,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:10:34,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:10:34,311 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 21:10:34,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:10:34,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:10:34,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:10:34,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:10:34,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:10:34,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:10:34,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:10:34,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:34,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:10:34,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:10:34,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:10:34,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:10:34,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:10:34,316 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:10:34,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:10:34,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:10:34,316 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_39c21383-fc0d-43bf-98c9-b33dda999f7f/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_39c21383-fc0d-43bf-98c9-b33dda999f7f/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 -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2022-11-02 21:10:34,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:10:34,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:10:34,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:10:34,588 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:10:34,589 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:10:34,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2022-11-02 21:10:34,681 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/data/f54ffbfa5/cbf71da7c56144e6a1f93d4ca49418a7/FLAG3758db802 [2022-11-02 21:10:35,229 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:10:35,231 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2022-11-02 21:10:35,246 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/data/f54ffbfa5/cbf71da7c56144e6a1f93d4ca49418a7/FLAG3758db802 [2022-11-02 21:10:35,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/data/f54ffbfa5/cbf71da7c56144e6a1f93d4ca49418a7 [2022-11-02 21:10:35,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:10:35,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:10:35,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:35,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:10:35,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:10:35,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:35,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54daa00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35, skipping insertion in model container [2022-11-02 21:10:35,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:35,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:10:35,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:10:35,888 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_39c21383-fc0d-43bf-98c9-b33dda999f7f/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i[30035,30048] [2022-11-02 21:10:35,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:35,918 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:10:35,951 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_39c21383-fc0d-43bf-98c9-b33dda999f7f/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i[30035,30048] [2022-11-02 21:10:35,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:35,984 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:10:35,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35 WrapperNode [2022-11-02 21:10:35,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:35,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:10:35,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:10:35,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:10:35,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,065 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-02 21:10:36,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:10:36,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:10:36,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:10:36,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:10:36,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,110 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:10:36,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:10:36,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:10:36,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:10:36,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (1/1) ... [2022-11-02 21:10:36,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:36,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:36,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:10:36,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:10:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-02 21:10:36,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-02 21:10:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 21:10:36,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 21:10:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:10:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 21:10:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:10:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:10:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:10:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:10:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:10:36,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:10:36,215 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:10:36,358 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:10:36,360 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:10:36,652 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:10:36,660 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:10:36,660 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:10:36,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:36 BoogieIcfgContainer [2022-11-02 21:10:36,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:10:36,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:10:36,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:10:36,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:10:36,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:10:35" (1/3) ... [2022-11-02 21:10:36,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:10:36, skipping insertion in model container [2022-11-02 21:10:36,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:35" (2/3) ... [2022-11-02 21:10:36,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:10:36, skipping insertion in model container [2022-11-02 21:10:36,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:36" (3/3) ... [2022-11-02 21:10:36,672 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2022-11-02 21:10:36,683 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:10:36,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:10:36,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-02 21:10:36,694 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:10:36,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:10:36,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 138 transitions, 286 flow [2022-11-02 21:10:36,950 INFO L130 PetriNetUnfolder]: 7/154 cut-off events. [2022-11-02 21:10:36,950 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:10:36,955 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 21:10:36,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 138 transitions, 286 flow [2022-11-02 21:10:36,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 282 flow [2022-11-02 21:10:36,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:10:36,999 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;@74721bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:10:36,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-02 21:10:37,023 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-02 21:10:37,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:10:37,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:37,028 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 21:10:37,028 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 21:10:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2090519078, now seen corresponding path program 1 times [2022-11-02 21:10:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:37,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766105052] [2022-11-02 21:10:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766105052] [2022-11-02 21:10:37,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766105052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:37,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:37,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238148084] [2022-11-02 21:10:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:37,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:37,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:37,370 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2022-11-02 21:10:37,373 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 21:10:37,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:37,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2022-11-02 21:10:37,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:37,492 INFO L130 PetriNetUnfolder]: 26/244 cut-off events. [2022-11-02 21:10:37,492 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 21:10:37,494 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 21:10:37,496 INFO L137 encePairwiseOnDemand]: 131/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/131 dead transitions. [2022-11-02 21:10:37,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 302 flow [2022-11-02 21:10:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-11-02 21:10:37,512 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8913043478260869 [2022-11-02 21:10:37,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-11-02 21:10:37,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-11-02 21:10:37,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:37,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-11-02 21:10:37,521 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 21:10:37,527 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 21:10:37,527 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 21:10:37,529 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 282 flow. Second operand 3 states and 369 transitions. [2022-11-02 21:10:37,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 302 flow [2022-11-02 21:10:37,534 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 21:10:37,537 INFO L231 Difference]: Finished difference. Result has 136 places, 130 transitions, 271 flow [2022-11-02 21:10:37,539 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 21:10:37,543 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-11-02 21:10:37,543 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 130 transitions, 271 flow [2022-11-02 21:10:37,544 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 21:10:37,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:37,544 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 21:10:37,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:10:37,545 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 21:10:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -907298788, now seen corresponding path program 1 times [2022-11-02 21:10:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:37,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282219307] [2022-11-02 21:10:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282219307] [2022-11-02 21:10:37,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282219307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:37,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:37,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400854382] [2022-11-02 21:10:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:37,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:37,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:37,647 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-11-02 21:10:37,648 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 21:10:37,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:37,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-11-02 21:10:37,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:37,780 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2022-11-02 21:10:37,780 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 21:10:37,783 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 21:10:37,810 INFO L137 encePairwiseOnDemand]: 135/138 looper letters, 20 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2022-11-02 21:10:37,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 129 transitions, 313 flow [2022-11-02 21:10:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-11-02 21:10:37,817 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2022-11-02 21:10:37,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2022-11-02 21:10:37,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2022-11-02 21:10:37,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:37,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2022-11-02 21:10:37,820 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 21:10:37,824 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 21:10:37,824 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 21:10:37,824 INFO L175 Difference]: Start difference. First operand has 136 places, 130 transitions, 271 flow. Second operand 3 states and 353 transitions. [2022-11-02 21:10:37,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 129 transitions, 313 flow [2022-11-02 21:10:37,828 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 21:10:37,832 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 269 flow [2022-11-02 21:10:37,832 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 21:10:37,833 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -3 predicate places. [2022-11-02 21:10:37,833 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 269 flow [2022-11-02 21:10:37,834 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 21:10:37,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:37,834 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 21:10:37,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:10:37,835 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 21:10:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -10396590, now seen corresponding path program 1 times [2022-11-02 21:10:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068422485] [2022-11-02 21:10:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068422485] [2022-11-02 21:10:37,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068422485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:37,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:37,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505747728] [2022-11-02 21:10:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:37,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:37,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:37,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:37,931 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-11-02 21:10:37,932 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 21:10:37,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:37,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-11-02 21:10:37,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:38,045 INFO L130 PetriNetUnfolder]: 44/420 cut-off events. [2022-11-02 21:10:38,045 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 21:10:38,047 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 21:10:38,049 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 1 changer transitions 0/124 dead transitions. [2022-11-02 21:10:38,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 287 flow [2022-11-02 21:10:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-11-02 21:10:38,052 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8647342995169082 [2022-11-02 21:10:38,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2022-11-02 21:10:38,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2022-11-02 21:10:38,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:38,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2022-11-02 21:10:38,054 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 21:10:38,055 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 21:10:38,055 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 21:10:38,055 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 269 flow. Second operand 3 states and 358 transitions. [2022-11-02 21:10:38,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 287 flow [2022-11-02 21:10:38,058 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 21:10:38,060 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 257 flow [2022-11-02 21:10:38,060 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 21:10:38,062 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -8 predicate places. [2022-11-02 21:10:38,063 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 257 flow [2022-11-02 21:10:38,063 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 21:10:38,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:38,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:38,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:10:38,064 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 21:10:38,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash -10200230, now seen corresponding path program 1 times [2022-11-02 21:10:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:38,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719017604] [2022-11-02 21:10:38,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:38,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:38,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719017604] [2022-11-02 21:10:38,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719017604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:38,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:38,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157206462] [2022-11-02 21:10:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:38,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:38,210 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 138 [2022-11-02 21:10:38,212 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 21:10:38,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:38,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 138 [2022-11-02 21:10:38,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:38,289 INFO L130 PetriNetUnfolder]: 16/249 cut-off events. [2022-11-02 21:10:38,290 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:10:38,291 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 21:10:38,293 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2022-11-02 21:10:38,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 306 flow [2022-11-02 21:10:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-11-02 21:10:38,295 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9106280193236715 [2022-11-02 21:10:38,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2022-11-02 21:10:38,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2022-11-02 21:10:38,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:38,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2022-11-02 21:10:38,298 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 21:10:38,303 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 21:10:38,303 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 21:10:38,304 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 257 flow. Second operand 3 states and 377 transitions. [2022-11-02 21:10:38,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 306 flow [2022-11-02 21:10:38,305 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 21:10:38,310 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 284 flow [2022-11-02 21:10:38,310 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 21:10:38,312 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -6 predicate places. [2022-11-02 21:10:38,312 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 284 flow [2022-11-02 21:10:38,318 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 21:10:38,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:38,319 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 21:10:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:10:38,321 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 21:10:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1135106733, now seen corresponding path program 1 times [2022-11-02 21:10:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:38,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109103674] [2022-11-02 21:10:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,500 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 21:10:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109103674] [2022-11-02 21:10:38,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109103674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:38,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:38,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:38,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637130791] [2022-11-02 21:10:38,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:38,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:38,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:38,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:38,504 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2022-11-02 21:10:38,505 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 21:10:38,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:38,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2022-11-02 21:10:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:38,565 INFO L130 PetriNetUnfolder]: 3/193 cut-off events. [2022-11-02 21:10:38,565 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 21:10:38,566 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 21:10:38,567 INFO L137 encePairwiseOnDemand]: 134/138 looper letters, 11 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2022-11-02 21:10:38,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 320 flow [2022-11-02 21:10:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-11-02 21:10:38,569 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2022-11-02 21:10:38,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2022-11-02 21:10:38,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2022-11-02 21:10:38,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:38,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2022-11-02 21:10:38,572 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 21:10:38,574 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 21:10:38,574 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 21:10:38,575 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 284 flow. Second operand 5 states and 616 transitions. [2022-11-02 21:10:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 320 flow [2022-11-02 21:10:38,576 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 21:10:38,578 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 280 flow [2022-11-02 21:10:38,578 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 21:10:38,579 INFO L287 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-11-02 21:10:38,580 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 280 flow [2022-11-02 21:10:38,580 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 21:10:38,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:38,581 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 21:10:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:10:38,581 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 21:10:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1692640194, now seen corresponding path program 1 times [2022-11-02 21:10:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556952965] [2022-11-02 21:10:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:10:38,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:10:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:10:38,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:10:38,657 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:10:38,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2022-11-02 21:10:38,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2022-11-02 21:10:38,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2022-11-02 21:10:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2022-11-02 21:10:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2022-11-02 21:10:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2022-11-02 21:10:38,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2022-11-02 21:10:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2022-11-02 21:10:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2022-11-02 21:10:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2022-11-02 21:10:38,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2022-11-02 21:10:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2022-11-02 21:10:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2022-11-02 21:10:38,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2022-11-02 21:10:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2022-11-02 21:10:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2022-11-02 21:10:38,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2022-11-02 21:10:38,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:10:38,665 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-02 21:10:38,667 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:10:38,667 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 21:10:38,698 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:10:38,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 188 transitions, 400 flow [2022-11-02 21:10:38,747 INFO L130 PetriNetUnfolder]: 10/208 cut-off events. [2022-11-02 21:10:38,747 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 21:10:38,749 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 21:10:38,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 188 transitions, 400 flow [2022-11-02 21:10:38,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 353 flow [2022-11-02 21:10:38,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:10:38,757 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;@74721bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:10:38,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-02 21:10:38,761 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-02 21:10:38,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:10:38,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:38,762 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 21:10:38,762 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 21:10:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:38,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1825814106, now seen corresponding path program 1 times [2022-11-02 21:10:38,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:38,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25993200] [2022-11-02 21:10:38,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:38,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25993200] [2022-11-02 21:10:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25993200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:38,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:38,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943012718] [2022-11-02 21:10:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:38,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:38,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:38,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:38,813 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 188 [2022-11-02 21:10:38,813 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 21:10:38,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:38,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 188 [2022-11-02 21:10:38,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:39,093 INFO L130 PetriNetUnfolder]: 377/1347 cut-off events. [2022-11-02 21:10:39,093 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-02 21:10:39,102 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 21:10:39,114 INFO L137 encePairwiseOnDemand]: 180/188 looper letters, 21 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2022-11-02 21:10:39,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 385 flow [2022-11-02 21:10:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-11-02 21:10:39,116 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8599290780141844 [2022-11-02 21:10:39,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-11-02 21:10:39,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-11-02 21:10:39,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:39,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-11-02 21:10:39,118 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 21:10:39,120 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 21:10:39,120 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 21:10:39,120 INFO L175 Difference]: Start difference. First operand has 169 places, 169 transitions, 353 flow. Second operand 3 states and 485 transitions. [2022-11-02 21:10:39,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 385 flow [2022-11-02 21:10:39,122 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 21:10:39,124 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2022-11-02 21:10:39,124 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 21:10:39,125 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -1 predicate places. [2022-11-02 21:10:39,125 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2022-11-02 21:10:39,126 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 21:10:39,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:39,126 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 21:10:39,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:10:39,127 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 21:10:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -424994472, now seen corresponding path program 1 times [2022-11-02 21:10:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:39,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061927860] [2022-11-02 21:10:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:39,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:39,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061927860] [2022-11-02 21:10:39,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061927860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:39,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:39,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988524526] [2022-11-02 21:10:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:39,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:39,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:39,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:39,161 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 188 [2022-11-02 21:10:39,162 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 21:10:39,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:39,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 188 [2022-11-02 21:10:39,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:39,688 INFO L130 PetriNetUnfolder]: 734/2801 cut-off events. [2022-11-02 21:10:39,688 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-02 21:10:39,700 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 21:10:39,716 INFO L137 encePairwiseOnDemand]: 185/188 looper letters, 24 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2022-11-02 21:10:39,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 388 flow [2022-11-02 21:10:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2022-11-02 21:10:39,718 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8404255319148937 [2022-11-02 21:10:39,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2022-11-02 21:10:39,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2022-11-02 21:10:39,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:39,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2022-11-02 21:10:39,719 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 21:10:39,722 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 21:10:39,723 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 21:10:39,723 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 474 transitions. [2022-11-02 21:10:39,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 388 flow [2022-11-02 21:10:39,725 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 21:10:39,727 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2022-11-02 21:10:39,728 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 21:10:39,729 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2022-11-02 21:10:39,729 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2022-11-02 21:10:39,730 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 21:10:39,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:39,730 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 21:10:39,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:10:39,730 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 21:10:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash -13758834, now seen corresponding path program 1 times [2022-11-02 21:10:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:39,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069292748] [2022-11-02 21:10:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:39,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069292748] [2022-11-02 21:10:39,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069292748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:39,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:39,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536151779] [2022-11-02 21:10:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:39,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:39,804 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 188 [2022-11-02 21:10:39,804 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 21:10:39,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:39,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 188 [2022-11-02 21:10:39,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:40,088 INFO L130 PetriNetUnfolder]: 233/1396 cut-off events. [2022-11-02 21:10:40,088 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-02 21:10:40,097 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 21:10:40,104 INFO L137 encePairwiseOnDemand]: 181/188 looper letters, 16 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2022-11-02 21:10:40,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 358 flow [2022-11-02 21:10:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-11-02 21:10:40,106 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.849290780141844 [2022-11-02 21:10:40,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2022-11-02 21:10:40,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2022-11-02 21:10:40,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:40,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2022-11-02 21:10:40,108 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 21:10:40,109 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 21:10:40,110 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 21:10:40,110 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 479 transitions. [2022-11-02 21:10:40,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 358 flow [2022-11-02 21:10:40,113 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 21:10:40,143 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2022-11-02 21:10:40,144 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 21:10:40,144 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2022-11-02 21:10:40,145 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2022-11-02 21:10:40,145 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 21:10:40,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:40,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:40,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:10:40,145 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 21:10:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1264049558, now seen corresponding path program 1 times [2022-11-02 21:10:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:40,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095132259] [2022-11-02 21:10:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:40,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095132259] [2022-11-02 21:10:40,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095132259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:40,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:40,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101947914] [2022-11-02 21:10:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:40,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:40,197 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 188 [2022-11-02 21:10:40,198 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 21:10:40,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:40,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 188 [2022-11-02 21:10:40,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:40,588 INFO L130 PetriNetUnfolder]: 350/1791 cut-off events. [2022-11-02 21:10:40,588 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-02 21:10:40,599 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 21:10:40,612 INFO L137 encePairwiseOnDemand]: 177/188 looper letters, 26 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2022-11-02 21:10:40,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 426 flow [2022-11-02 21:10:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-02 21:10:40,614 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2022-11-02 21:10:40,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-02 21:10:40,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-02 21:10:40,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:40,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-02 21:10:40,617 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 21:10:40,618 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 21:10:40,619 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 21:10:40,619 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 502 transitions. [2022-11-02 21:10:40,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 426 flow [2022-11-02 21:10:40,621 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 21:10:40,623 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2022-11-02 21:10:40,624 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 21:10:40,624 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -6 predicate places. [2022-11-02 21:10:40,625 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2022-11-02 21:10:40,625 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 21:10:40,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:40,625 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 21:10:40,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:10:40,626 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 21:10:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2096221313, now seen corresponding path program 1 times [2022-11-02 21:10:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:40,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209050487] [2022-11-02 21:10:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209050487] [2022-11-02 21:10:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209050487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:40,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:40,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:10:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083636478] [2022-11-02 21:10:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:40,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:40,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:40,691 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 188 [2022-11-02 21:10:40,692 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 21:10:40,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:40,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 188 [2022-11-02 21:10:40,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:41,116 INFO L130 PetriNetUnfolder]: 526/1995 cut-off events. [2022-11-02 21:10:41,117 INFO L131 PetriNetUnfolder]: For 701/836 co-relation queries the response was YES. [2022-11-02 21:10:41,132 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 21:10:41,152 INFO L137 encePairwiseOnDemand]: 181/188 looper letters, 37 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2022-11-02 21:10:41,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 558 flow [2022-11-02 21:10:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:10:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-11-02 21:10:41,155 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2022-11-02 21:10:41,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-11-02 21:10:41,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-11-02 21:10:41,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:41,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-11-02 21:10:41,157 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 21:10:41,158 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 21:10:41,158 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 21:10:41,159 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 494 transitions. [2022-11-02 21:10:41,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 558 flow [2022-11-02 21:10:41,164 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 21:10:41,167 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2022-11-02 21:10:41,168 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 21:10:41,169 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, -4 predicate places. [2022-11-02 21:10:41,169 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2022-11-02 21:10:41,169 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 21:10:41,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:41,169 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 21:10:41,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:10:41,170 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 21:10:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1978733824, now seen corresponding path program 1 times [2022-11-02 21:10:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:41,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420129917] [2022-11-02 21:10:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:41,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420129917] [2022-11-02 21:10:41,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420129917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:41,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:41,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049795134] [2022-11-02 21:10:41,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:41,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:41,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:41,320 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2022-11-02 21:10:41,321 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 21:10:41,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:41,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2022-11-02 21:10:41,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:41,527 INFO L130 PetriNetUnfolder]: 154/1067 cut-off events. [2022-11-02 21:10:41,527 INFO L131 PetriNetUnfolder]: For 230/451 co-relation queries the response was YES. [2022-11-02 21:10:41,537 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 21:10:41,542 INFO L137 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2022-11-02 21:10:41,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 499 flow [2022-11-02 21:10:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2022-11-02 21:10:41,546 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8957446808510638 [2022-11-02 21:10:41,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2022-11-02 21:10:41,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2022-11-02 21:10:41,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:41,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2022-11-02 21:10:41,549 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 21:10:41,551 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 21:10:41,551 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 21:10:41,552 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 842 transitions. [2022-11-02 21:10:41,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 499 flow [2022-11-02 21:10:41,555 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 21:10:41,557 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2022-11-02 21:10:41,557 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 21:10:41,558 INFO L287 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2022-11-02 21:10:41,559 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2022-11-02 21:10:41,559 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 21:10:41,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:41,559 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 21:10:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:10:41,560 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 21:10:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1181173309, now seen corresponding path program 1 times [2022-11-02 21:10:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199097012] [2022-11-02 21:10:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:10:41,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:10:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:10:41,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:10:41,618 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:10:41,618 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-02 21:10:41,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-02 21:10:41,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-02 21:10:41,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-02 21:10:41,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-02 21:10:41,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-02 21:10:41,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-02 21:10:41,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-02 21:10:41,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-02 21:10:41,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-02 21:10:41,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2022-11-02 21:10:41,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2022-11-02 21:10:41,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2022-11-02 21:10:41,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-02 21:10:41,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-02 21:10:41,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-02 21:10:41,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-02 21:10:41,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-02 21:10:41,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-02 21:10:41,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-02 21:10:41,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-02 21:10:41,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-02 21:10:41,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:10:41,623 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:41,628 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-11-02 21:10:41,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:10:41,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:10:41 BasicIcfg [2022-11-02 21:10:41,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:10:41,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:10:41,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:10:41,758 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:10:41,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:36" (3/4) ... [2022-11-02 21:10:41,761 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 21:10:41,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:10:41,762 INFO L158 Benchmark]: Toolchain (without parser) took 6257.56ms. Allocated memory was 127.9MB in the beginning and 291.5MB in the end (delta: 163.6MB). Free memory was 98.3MB in the beginning and 115.9MB in the end (delta: -17.5MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB. [2022-11-02 21:10:41,762 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 127.9MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:10:41,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.79ms. Allocated memory is still 127.9MB. Free memory was 97.9MB in the beginning and 92.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:10:41,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.23ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:10:41,764 INFO L158 Benchmark]: Boogie Preprocessor took 58.02ms. Allocated memory is still 127.9MB. Free memory was 90.2MB in the beginning and 88.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:10:41,764 INFO L158 Benchmark]: RCFGBuilder took 537.64ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 73.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:10:41,764 INFO L158 Benchmark]: TraceAbstraction took 5091.64ms. Allocated memory was 127.9MB in the beginning and 291.5MB in the end (delta: 163.6MB). Free memory was 72.3MB in the beginning and 115.9MB in the end (delta: -43.6MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. [2022-11-02 21:10:41,765 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 291.5MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:10:41,768 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.33ms. Allocated memory is still 127.9MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.79ms. Allocated memory is still 127.9MB. Free memory was 97.9MB in the beginning and 92.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.23ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.02ms. Allocated memory is still 127.9MB. Free memory was 90.2MB in the beginning and 88.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.64ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 73.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5091.64ms. Allocated memory was 127.9MB in the beginning and 291.5MB in the end (delta: 163.6MB). Free memory was 72.3MB in the beginning and 115.9MB in the end (delta: -43.6MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 291.5MB. Free memory is still 115.9MB. 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()=10, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, 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=10, 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=10, 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=10, 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=10, 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=10, 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=10, pthread_create(&t1, 0, thr1, 0)=13, t1={6:0}, t2={5:0}, x=0] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, 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=10, 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=10, 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=10, 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=10, pthread_create(&t2, 0, thr2, 0)=14, t1={6:0}, t2={5:0}, x=0] [L697] 2 int t; VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=10, arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, 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=10, 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=10, mut={3:0}, n=10, t=0, x=0] [L702] 2 k == n VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] COND TRUE 2 k == n VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L703] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=1, x = t + 1=50] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, 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: 1.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s 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.1s 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: 2.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, 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.1s 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 21:10:41,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c21383-fc0d-43bf-98c9-b33dda999f7f/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