./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R --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 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 --- 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-38b53e6 [2022-11-25 17:20:38,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:20:38,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:20:38,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:20:38,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:20:38,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:20:38,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:20:38,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:20:38,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:20:38,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:20:38,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:20:38,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:20:38,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:20:38,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:20:38,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:20:38,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:20:38,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:20:38,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:20:38,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:20:38,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:20:38,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:20:38,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:20:38,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:20:38,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:20:38,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:20:38,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:20:38,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:20:38,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:20:38,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:20:38,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:20:38,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:20:38,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:20:38,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:20:38,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:20:38,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:20:38,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:20:38,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:20:38,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:20:38,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:20:38,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:20:38,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:20:38,252 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-25 17:20:38,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:20:38,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:20:38,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:20:38,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:20:38,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:20:38,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:20:38,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:20:38,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:20:38,290 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:20:38,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:20:38,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:20:38,292 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:20:38,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:20:38,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:20:38,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:20:38,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:20:38,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:20:38,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:20:38,293 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-25 17:20:38,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:20:38,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:20:38,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:20:38,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:20:38,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:20:38,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:20:38,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:20:38,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:20:38,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:20:38,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:20:38,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:20:38,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:20:38,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:20:38,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:20:38,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:20:38,298 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:20:38,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:20:38,298 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/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_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R 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 -> 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 [2022-11-25 17:20:38,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:20:38,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:20:38,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:20:38,622 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:20:38,622 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:20:38,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2022-11-25 17:20:41,535 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:20:41,837 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:20:41,837 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2022-11-25 17:20:41,849 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/data/e5c79c2d2/ed5e188a2e0b449fa0d18a243180e55e/FLAG881cf740a [2022-11-25 17:20:41,864 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/data/e5c79c2d2/ed5e188a2e0b449fa0d18a243180e55e [2022-11-25 17:20:41,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:20:41,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:20:41,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:20:41,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:20:41,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:20:41,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:20:41" (1/1) ... [2022-11-25 17:20:41,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4bc3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:41, skipping insertion in model container [2022-11-25 17:20:41,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:20:41" (1/1) ... [2022-11-25 17:20:41,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:20:41,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:20:42,293 WARN L237 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_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i[30010,30023] [2022-11-25 17:20:42,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:20:42,313 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:20:42,367 WARN L237 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_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i[30010,30023] [2022-11-25 17:20:42,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:20:42,414 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:20:42,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42 WrapperNode [2022-11-25 17:20:42,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:20:42,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:20:42,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:20:42,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:20:42,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,458 INFO L138 Inliner]: procedures = 167, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-11-25 17:20:42,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:20:42,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:20:42,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:20:42,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:20:42,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:20:42,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:20:42,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:20:42,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:20:42,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (1/1) ... [2022-11-25 17:20:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:20:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:42,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:20:42,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:20:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-25 17:20:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-25 17:20:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:20:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:20:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:20:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:20:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:20:42,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:20:42,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:20:42,574 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:20:42,759 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:20:42,761 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:20:42,894 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:20:42,902 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:20:42,905 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:20:42,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:20:42 BoogieIcfgContainer [2022-11-25 17:20:42,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:20:42,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:20:42,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:20:42,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:20:42,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:20:41" (1/3) ... [2022-11-25 17:20:42,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746368d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:20:42, skipping insertion in model container [2022-11-25 17:20:42,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:20:42" (2/3) ... [2022-11-25 17:20:42,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746368d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:20:42, skipping insertion in model container [2022-11-25 17:20:42,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:20:42" (3/3) ... [2022-11-25 17:20:42,918 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs-b.i [2022-11-25 17:20:42,927 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:20:42,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:20:42,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-25 17:20:42,939 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:20:42,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:20:43,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 119 flow [2022-11-25 17:20:43,053 INFO L130 PetriNetUnfolder]: 3/68 cut-off events. [2022-11-25 17:20:43,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:20:43,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 68 events. 3/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-11-25 17:20:43,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 57 transitions, 119 flow [2022-11-25 17:20:43,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 119 flow [2022-11-25 17:20:43,066 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:20:43,081 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 57 transitions, 119 flow [2022-11-25 17:20:43,084 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 119 flow [2022-11-25 17:20:43,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 119 flow [2022-11-25 17:20:43,103 INFO L130 PetriNetUnfolder]: 3/68 cut-off events. [2022-11-25 17:20:43,103 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:20:43,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 68 events. 3/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-11-25 17:20:43,105 INFO L119 LiptonReduction]: Number of co-enabled transitions 560 [2022-11-25 17:20:44,594 INFO L134 LiptonReduction]: Checked pairs total: 494 [2022-11-25 17:20:44,595 INFO L136 LiptonReduction]: Total number of compositions: 61 [2022-11-25 17:20:44,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:20:44,631 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;@35b6b9aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:20:44,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 17:20:44,632 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:20:44,633 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:20:44,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:44,633 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:20:44,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:20:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 1 times [2022-11-25 17:20:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:44,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109709317] [2022-11-25 17:20:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:44,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:20:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:44,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109709317] [2022-11-25 17:20:44,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109709317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:44,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:44,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:20:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625093275] [2022-11-25 17:20:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:44,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:20:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:44,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:20:44,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:20:44,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 118 [2022-11-25 17:20:44,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 10 transitions, 25 flow. Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:44,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:44,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 118 [2022-11-25 17:20:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:44,862 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-11-25 17:20:44,863 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:20:44,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 12 events. 2/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 2 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2022-11-25 17:20:44,864 INFO L137 encePairwiseOnDemand]: 114/118 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2022-11-25 17:20:44,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 27 flow [2022-11-25 17:20:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:20:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:20:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2022-11-25 17:20:44,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4788135593220339 [2022-11-25 17:20:44,879 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 113 transitions. [2022-11-25 17:20:44,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 113 transitions. [2022-11-25 17:20:44,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:44,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 113 transitions. [2022-11-25 17:20:44,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:44,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:44,898 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:44,901 INFO L175 Difference]: Start difference. First operand has 13 places, 10 transitions, 25 flow. Second operand 2 states and 113 transitions. [2022-11-25 17:20:44,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 27 flow [2022-11-25 17:20:44,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:20:44,905 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 17 flow [2022-11-25 17:20:44,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2022-11-25 17:20:44,911 INFO L288 CegarLoopForPetriNet]: 13 programPoint places, -3 predicate places. [2022-11-25 17:20:44,912 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 17 flow [2022-11-25 17:20:44,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:44,912 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:44,913 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-11-25 17:20:44,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:20:44,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:20:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1572108006, now seen corresponding path program 1 times [2022-11-25 17:20:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:44,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359052011] [2022-11-25 17:20:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:20:44,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:20:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:20:45,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:20:45,036 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:20:45,038 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-25 17:20:45,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-11-25 17:20:45,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-11-25 17:20:45,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-11-25 17:20:45,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-11-25 17:20:45,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-11-25 17:20:45,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:20:45,043 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 17:20:45,045 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 17:20:45,045 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-25 17:20:45,059 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:20:45,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 168 flow [2022-11-25 17:20:45,088 INFO L130 PetriNetUnfolder]: 5/102 cut-off events. [2022-11-25 17:20:45,088 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 17:20:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 5/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 69. Up to 6 conditions per place. [2022-11-25 17:20:45,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 78 transitions, 168 flow [2022-11-25 17:20:45,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 78 transitions, 168 flow [2022-11-25 17:20:45,092 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:20:45,092 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 78 transitions, 168 flow [2022-11-25 17:20:45,093 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 78 transitions, 168 flow [2022-11-25 17:20:45,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 168 flow [2022-11-25 17:20:45,149 INFO L130 PetriNetUnfolder]: 5/102 cut-off events. [2022-11-25 17:20:45,149 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 17:20:45,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 5/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 69. Up to 6 conditions per place. [2022-11-25 17:20:45,152 INFO L119 LiptonReduction]: Number of co-enabled transitions 1960 [2022-11-25 17:20:46,590 INFO L134 LiptonReduction]: Checked pairs total: 6259 [2022-11-25 17:20:46,591 INFO L136 LiptonReduction]: Total number of compositions: 70 [2022-11-25 17:20:46,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:20:46,602 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;@35b6b9aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:20:46,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 17:20:46,608 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:20:46,608 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:20:46,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:46,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:20:46,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:20:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash 404, now seen corresponding path program 1 times [2022-11-25 17:20:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:46,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366792718] [2022-11-25 17:20:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:46,634 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-25 17:20:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366792718] [2022-11-25 17:20:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366792718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:46,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:20:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336860855] [2022-11-25 17:20:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:46,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:20:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:20:46,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:20:46,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 148 [2022-11-25 17:20:46,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:46,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 148 [2022-11-25 17:20:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:46,695 INFO L130 PetriNetUnfolder]: 49/155 cut-off events. [2022-11-25 17:20:46,696 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-25 17:20:46,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 155 events. 49/155 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 710 event pairs, 49 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 59. Up to 100 conditions per place. [2022-11-25 17:20:46,700 INFO L137 encePairwiseOnDemand]: 144/148 looper letters, 11 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2022-11-25 17:20:46,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 80 flow [2022-11-25 17:20:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:20:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:20:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 155 transitions. [2022-11-25 17:20:46,709 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5236486486486487 [2022-11-25 17:20:46,710 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 155 transitions. [2022-11-25 17:20:46,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 155 transitions. [2022-11-25 17:20:46,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:46,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 155 transitions. [2022-11-25 17:20:46,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,716 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,717 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 66 flow. Second operand 2 states and 155 transitions. [2022-11-25 17:20:46,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 80 flow [2022-11-25 17:20:46,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 78 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 17:20:46,718 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 56 flow [2022-11-25 17:20:46,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2022-11-25 17:20:46,719 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2022-11-25 17:20:46,719 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 56 flow [2022-11-25 17:20:46,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:46,720 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:20:46,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:20:46,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:20:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -924076981, now seen corresponding path program 1 times [2022-11-25 17:20:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:46,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086572772] [2022-11-25 17:20:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:46,784 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-25 17:20:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086572772] [2022-11-25 17:20:46,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086572772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:46,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:46,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:20:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754437442] [2022-11-25 17:20:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:46,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:20:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:20:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:20:46,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 148 [2022-11-25 17:20:46,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:46,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 148 [2022-11-25 17:20:46,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:46,899 INFO L130 PetriNetUnfolder]: 93/246 cut-off events. [2022-11-25 17:20:46,899 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 17:20:46,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 246 events. 93/246 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1270 event pairs, 72 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 448. Up to 157 conditions per place. [2022-11-25 17:20:46,902 INFO L137 encePairwiseOnDemand]: 143/148 looper letters, 17 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2022-11-25 17:20:46,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 117 flow [2022-11-25 17:20:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:20:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:20:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2022-11-25 17:20:46,905 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4617117117117117 [2022-11-25 17:20:46,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 205 transitions. [2022-11-25 17:20:46,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions. [2022-11-25 17:20:46,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:46,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions. [2022-11-25 17:20:46,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,914 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 56 flow. Second operand 3 states and 205 transitions. [2022-11-25 17:20:46,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 117 flow [2022-11-25 17:20:46,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 117 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:20:46,916 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 82 flow [2022-11-25 17:20:46,917 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-11-25 17:20:46,924 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-11-25 17:20:46,924 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 82 flow [2022-11-25 17:20:46,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:46,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:46,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:46,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:20:46,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:20:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1020279327, now seen corresponding path program 1 times [2022-11-25 17:20:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:46,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364266297] [2022-11-25 17:20:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:46,985 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-25 17:20:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364266297] [2022-11-25 17:20:46,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364266297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:46,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:46,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:20:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287994023] [2022-11-25 17:20:46,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:46,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:20:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:46,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:20:46,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:20:47,015 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 148 [2022-11-25 17:20:47,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:47,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 148 [2022-11-25 17:20:47,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:47,102 INFO L130 PetriNetUnfolder]: 154/342 cut-off events. [2022-11-25 17:20:47,102 INFO L131 PetriNetUnfolder]: For 95/103 co-relation queries the response was YES. [2022-11-25 17:20:47,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 342 events. 154/342 cut-off events. For 95/103 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1797 event pairs, 54 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 775. Up to 186 conditions per place. [2022-11-25 17:20:47,105 INFO L137 encePairwiseOnDemand]: 140/148 looper letters, 27 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2022-11-25 17:20:47,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 195 flow [2022-11-25 17:20:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:20:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:20:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2022-11-25 17:20:47,108 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2022-11-25 17:20:47,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 215 transitions. [2022-11-25 17:20:47,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 215 transitions. [2022-11-25 17:20:47,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:47,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 215 transitions. [2022-11-25 17:20:47,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,113 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 82 flow. Second operand 3 states and 215 transitions. [2022-11-25 17:20:47,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 195 flow [2022-11-25 17:20:47,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:20:47,116 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 140 flow [2022-11-25 17:20:47,116 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2022-11-25 17:20:47,118 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-11-25 17:20:47,118 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 140 flow [2022-11-25 17:20:47,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:47,119 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:47,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:20:47,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:20:47,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash -544435224, now seen corresponding path program 1 times [2022-11-25 17:20:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:47,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084194745] [2022-11-25 17:20:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:20:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:47,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084194745] [2022-11-25 17:20:47,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084194745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:47,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:47,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:20:47,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787838513] [2022-11-25 17:20:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:47,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:20:47,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:47,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:20:47,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:20:47,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 148 [2022-11-25 17:20:47,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:47,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 148 [2022-11-25 17:20:47,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:47,301 INFO L130 PetriNetUnfolder]: 177/375 cut-off events. [2022-11-25 17:20:47,301 INFO L131 PetriNetUnfolder]: For 268/282 co-relation queries the response was YES. [2022-11-25 17:20:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 375 events. 177/375 cut-off events. For 268/282 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1979 event pairs, 91 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 1020. Up to 246 conditions per place. [2022-11-25 17:20:47,305 INFO L137 encePairwiseOnDemand]: 142/148 looper letters, 24 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2022-11-25 17:20:47,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 256 flow [2022-11-25 17:20:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:20:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:20:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2022-11-25 17:20:47,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2022-11-25 17:20:47,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 207 transitions. [2022-11-25 17:20:47,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 207 transitions. [2022-11-25 17:20:47,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:47,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 207 transitions. [2022-11-25 17:20:47,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,310 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 140 flow. Second operand 3 states and 207 transitions. [2022-11-25 17:20:47,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 256 flow [2022-11-25 17:20:47,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:20:47,342 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 206 flow [2022-11-25 17:20:47,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2022-11-25 17:20:47,343 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-11-25 17:20:47,343 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 206 flow [2022-11-25 17:20:47,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:47,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:47,344 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-25 17:20:47,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:20:47,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:20:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 299154911, now seen corresponding path program 1 times [2022-11-25 17:20:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:47,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575715896] [2022-11-25 17:20:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:20:47,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:20:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:20:47,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:20:47,375 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:20:47,375 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-25 17:20:47,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-25 17:20:47,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-25 17:20:47,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-25 17:20:47,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-11-25 17:20:47,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-25 17:20:47,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-25 17:20:47,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-11-25 17:20:47,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:20:47,377 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-25 17:20:47,378 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 17:20:47,378 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-25 17:20:47,397 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:20:47,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 99 transitions, 219 flow [2022-11-25 17:20:47,419 INFO L130 PetriNetUnfolder]: 7/136 cut-off events. [2022-11-25 17:20:47,419 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 17:20:47,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 136 events. 7/136 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 271 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2022-11-25 17:20:47,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 99 transitions, 219 flow [2022-11-25 17:20:47,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 99 transitions, 219 flow [2022-11-25 17:20:47,422 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:20:47,422 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 99 transitions, 219 flow [2022-11-25 17:20:47,423 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 99 transitions, 219 flow [2022-11-25 17:20:47,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 99 transitions, 219 flow [2022-11-25 17:20:47,446 INFO L130 PetriNetUnfolder]: 7/136 cut-off events. [2022-11-25 17:20:47,446 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 17:20:47,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 136 events. 7/136 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 271 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2022-11-25 17:20:47,450 INFO L119 LiptonReduction]: Number of co-enabled transitions 4200 [2022-11-25 17:20:49,081 INFO L134 LiptonReduction]: Checked pairs total: 14055 [2022-11-25 17:20:49,081 INFO L136 LiptonReduction]: Total number of compositions: 87 [2022-11-25 17:20:49,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:20:49,086 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;@35b6b9aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:20:49,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-25 17:20:49,087 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:20:49,087 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:20:49,087 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:49,087 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:20:49,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-25 17:20:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2022-11-25 17:20:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:49,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533842738] [2022-11-25 17:20:49,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:49,097 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-25 17:20:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:49,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533842738] [2022-11-25 17:20:49,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533842738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:20:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340286777] [2022-11-25 17:20:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:49,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:20:49,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:20:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:20:49,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 186 [2022-11-25 17:20:49,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 95 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:49,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 186 [2022-11-25 17:20:49,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:49,238 INFO L130 PetriNetUnfolder]: 459/1106 cut-off events. [2022-11-25 17:20:49,238 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-11-25 17:20:49,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 1106 events. 459/1106 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7580 event pairs, 459 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 329. Up to 722 conditions per place. [2022-11-25 17:20:49,247 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 16 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 17:20:49,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 117 flow [2022-11-25 17:20:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:20:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:20:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2022-11-25 17:20:49,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5295698924731183 [2022-11-25 17:20:49,249 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2022-11-25 17:20:49,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2022-11-25 17:20:49,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:49,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2022-11-25 17:20:49,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,251 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,251 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 95 flow. Second operand 2 states and 197 transitions. [2022-11-25 17:20:49,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 117 flow [2022-11-25 17:20:49,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 111 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 17:20:49,253 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 79 flow [2022-11-25 17:20:49,254 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=79, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-11-25 17:20:49,254 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-11-25 17:20:49,254 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 79 flow [2022-11-25 17:20:49,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:49,255 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:20:49,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:20:49,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-25 17:20:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash 814606513, now seen corresponding path program 1 times [2022-11-25 17:20:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:49,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47209690] [2022-11-25 17:20:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:20:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:49,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47209690] [2022-11-25 17:20:49,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47209690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:49,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:49,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:20:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224601521] [2022-11-25 17:20:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:49,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:20:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:20:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:20:49,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2022-11-25 17:20:49,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:49,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2022-11-25 17:20:49,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:49,551 INFO L130 PetriNetUnfolder]: 1083/2081 cut-off events. [2022-11-25 17:20:49,551 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-11-25 17:20:49,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2081 events. 1083/2081 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13955 event pairs, 855 based on Foata normal form. 0/1774 useless extension candidates. Maximal degree in co-relation 3906. Up to 1472 conditions per place. [2022-11-25 17:20:49,565 INFO L137 encePairwiseOnDemand]: 179/186 looper letters, 27 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2022-11-25 17:20:49,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 181 flow [2022-11-25 17:20:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:20:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:20:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-11-25 17:20:49,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47491039426523296 [2022-11-25 17:20:49,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2022-11-25 17:20:49,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2022-11-25 17:20:49,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:49,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2022-11-25 17:20:49,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,570 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 79 flow. Second operand 3 states and 265 transitions. [2022-11-25 17:20:49,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 181 flow [2022-11-25 17:20:49,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:20:49,572 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 119 flow [2022-11-25 17:20:49,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-11-25 17:20:49,573 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-25 17:20:49,573 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 119 flow [2022-11-25 17:20:49,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:49,574 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:49,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:20:49,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-25 17:20:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1152874116, now seen corresponding path program 1 times [2022-11-25 17:20:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:49,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160381507] [2022-11-25 17:20:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:49,597 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-25 17:20:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:49,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160381507] [2022-11-25 17:20:49,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160381507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:49,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:49,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:20:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568709828] [2022-11-25 17:20:49,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:49,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:20:49,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:49,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:20:49,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:20:49,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 186 [2022-11-25 17:20:49,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:49,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:49,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 186 [2022-11-25 17:20:49,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:50,153 INFO L130 PetriNetUnfolder]: 2790/4644 cut-off events. [2022-11-25 17:20:50,154 INFO L131 PetriNetUnfolder]: For 1318/1436 co-relation queries the response was YES. [2022-11-25 17:20:50,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 4644 events. 2790/4644 cut-off events. For 1318/1436 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 31411 event pairs, 964 based on Foata normal form. 2/4326 useless extension candidates. Maximal degree in co-relation 10750. Up to 2660 conditions per place. [2022-11-25 17:20:50,252 INFO L137 encePairwiseOnDemand]: 174/186 looper letters, 42 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2022-11-25 17:20:50,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 317 flow [2022-11-25 17:20:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:20:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:20:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-11-25 17:20:50,254 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2022-11-25 17:20:50,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2022-11-25 17:20:50,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2022-11-25 17:20:50,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:50,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2022-11-25 17:20:50,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,257 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 119 flow. Second operand 3 states and 273 transitions. [2022-11-25 17:20:50,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 317 flow [2022-11-25 17:20:50,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:20:50,268 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 241 flow [2022-11-25 17:20:50,269 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-11-25 17:20:50,272 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-11-25 17:20:50,272 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 241 flow [2022-11-25 17:20:50,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,272 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:50,272 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:50,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:20:50,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-25 17:20:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -444941878, now seen corresponding path program 1 times [2022-11-25 17:20:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:50,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777095243] [2022-11-25 17:20:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:20:50,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777095243] [2022-11-25 17:20:50,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777095243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:20:50,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:20:50,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:20:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855304567] [2022-11-25 17:20:50,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:20:50,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:20:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:50,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:20:50,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:20:50,358 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2022-11-25 17:20:50,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:50,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2022-11-25 17:20:50,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:50,868 INFO L130 PetriNetUnfolder]: 2567/4491 cut-off events. [2022-11-25 17:20:50,868 INFO L131 PetriNetUnfolder]: For 4835/5209 co-relation queries the response was YES. [2022-11-25 17:20:50,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12538 conditions, 4491 events. 2567/4491 cut-off events. For 4835/5209 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 31936 event pairs, 1342 based on Foata normal form. 74/4179 useless extension candidates. Maximal degree in co-relation 12529. Up to 3291 conditions per place. [2022-11-25 17:20:50,905 INFO L137 encePairwiseOnDemand]: 179/186 looper letters, 38 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2022-11-25 17:20:50,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 418 flow [2022-11-25 17:20:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:20:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:20:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2022-11-25 17:20:50,906 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2022-11-25 17:20:50,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2022-11-25 17:20:50,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2022-11-25 17:20:50,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:50,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2022-11-25 17:20:50,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,909 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 241 flow. Second operand 3 states and 264 transitions. [2022-11-25 17:20:50,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 418 flow [2022-11-25 17:20:50,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:20:50,923 INFO L231 Difference]: Finished difference. Result has 47 places, 59 transitions, 320 flow [2022-11-25 17:20:50,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=47, PETRI_TRANSITIONS=59} [2022-11-25 17:20:50,924 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-11-25 17:20:50,924 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 59 transitions, 320 flow [2022-11-25 17:20:50,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:20:50,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:50,924 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:50,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:20:50,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-25 17:20:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash -423933936, now seen corresponding path program 1 times [2022-11-25 17:20:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945394198] [2022-11-25 17:20:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:20:50,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:20:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:20:50,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:20:50,965 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:20:50,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2022-11-25 17:20:50,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2022-11-25 17:20:50,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2022-11-25 17:20:50,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2022-11-25 17:20:50,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2022-11-25 17:20:50,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2022-11-25 17:20:50,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2022-11-25 17:20:50,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2022-11-25 17:20:50,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2022-11-25 17:20:50,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2022-11-25 17:20:50,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:20:50,967 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-25 17:20:50,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-25 17:20:50,972 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:20:51,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:20:51 BasicIcfg [2022-11-25 17:20:51,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:20:51,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:20:51,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:20:51,017 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:20:51,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:20:42" (3/4) ... [2022-11-25 17:20:51,022 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:20:51,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:20:51,023 INFO L158 Benchmark]: Toolchain (without parser) took 9155.26ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 126.0MB in the beginning and 106.3MB in the end (delta: 19.7MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2022-11-25 17:20:51,023 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 115.3MB. Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:20:51,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.77ms. Allocated memory is still 157.3MB. Free memory was 126.0MB in the beginning and 106.8MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:20:51,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.13ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 105.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:20:51,024 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 157.3MB. Free memory was 105.2MB in the beginning and 103.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:20:51,025 INFO L158 Benchmark]: RCFGBuilder took 423.16ms. Allocated memory is still 157.3MB. Free memory was 103.1MB in the beginning and 92.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:20:51,025 INFO L158 Benchmark]: TraceAbstraction took 8105.63ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 91.3MB in the beginning and 106.3MB in the end (delta: -15.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-11-25 17:20:51,025 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 226.5MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:20:51,028 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.36ms. Allocated memory is still 115.3MB. Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.77ms. Allocated memory is still 157.3MB. Free memory was 126.0MB in the beginning and 106.8MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.13ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 105.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 157.3MB. Free memory was 105.2MB in the beginning and 103.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.16ms. Allocated memory is still 157.3MB. Free memory was 103.1MB in the beginning and 92.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8105.63ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 91.3MB in the beginning and 106.3MB in the end (delta: -15.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 226.5MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 58 PlacesBefore, 13 PlacesAfterwards, 57 TransitionsBefore, 10 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 61 TotalNumberOfCompositions, 494 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 494, independent: 494, independent conditional: 0, independent unconditional: 494, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 375, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 375, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 494, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 375, unknown conditional: 0, unknown unconditional: 375] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 80 PlacesBefore, 30 PlacesAfterwards, 78 TransitionsBefore, 27 TransitionsAfterwards, 1960 CoEnabledTransitionPairs, 8 FixpointIterations, 24 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 6259 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3278, independent: 3038, independent conditional: 0, independent unconditional: 3038, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1402, independent: 1362, independent conditional: 0, independent unconditional: 1362, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1402, independent: 1308, independent conditional: 0, independent unconditional: 1308, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3278, independent: 1676, independent conditional: 0, independent unconditional: 1676, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 1402, unknown conditional: 0, unknown unconditional: 1402] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 102 PlacesBefore, 41 PlacesAfterwards, 99 TransitionsBefore, 37 TransitionsAfterwards, 4200 CoEnabledTransitionPairs, 7 FixpointIterations, 23 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 14055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5740, independent: 5411, independent conditional: 0, independent unconditional: 5411, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3125, independent: 3056, independent conditional: 0, independent unconditional: 3056, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3125, independent: 2900, independent conditional: 0, independent unconditional: 2900, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 225, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5740, independent: 2355, independent conditional: 0, independent unconditional: 2355, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 3125, unknown conditional: 0, unknown unconditional: 3125] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 690]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int s; [L696] 0 s = __VERIFIER_nondet_int() [L697] 0 pthread_t t; VAL [s=0, t={3:0}] [L698] COND TRUE 0 1 [L698] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [arg={0:0}, pthread_create(&t, 0, thr1, 0)=-1, s=0, t={3:0}] [L698] COND TRUE 0 1 [L688] 1 int l = __VERIFIER_nondet_int(); [L689] 1 l = 4 [L690] 1 s = l VAL [arg={0:0}, arg={0:0}, l=4, s=4, s = l=49] [L698] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [arg={0:0}, arg={0:0}, l=4, pthread_create(&t, 0, thr1, 0)=0, s=4, s = l=49, t={3:0}] [L688] 2 int l = __VERIFIER_nondet_int(); [L689] 2 l = 4 [L690] 2 s = l VAL [arg={0:0}, arg={0:0}, l=4, s=4, s = l=49] Now there is a data race on ~s~0 between C: s = __VERIFIER_nondet_int() [696] and C: s = l [690] - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: 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 3 procedures, 76 locations, 6 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.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 96 locations, 8 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.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 4 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=4, InterpolantAutomatonStates: 11, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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 3 thread instances CFG has 5 procedures, 116 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 6 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=4, InterpolantAutomatonStates: 11, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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 proved your program to be incorrect! [2022-11-25 17:20:51,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65fcfcd-44c6-4ab2-ab29-f242b57cf0b9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE