./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a --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 dd8583a115904a75c64c276a67bc1fecbbb0d70873f2ea75f8f51b865297f64f --- 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-b5237d8 [2022-11-21 16:22:35,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:22:35,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:22:35,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:22:35,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:22:35,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:22:35,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:22:35,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:22:35,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:22:35,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:22:35,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:22:35,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:22:35,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:22:35,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:22:35,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:22:35,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:22:35,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:22:35,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:22:35,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:22:35,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:22:35,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:22:35,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:22:35,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:22:35,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:22:35,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:22:35,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:22:35,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:22:35,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:22:35,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:22:35,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:22:35,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:22:35,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:22:35,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:22:35,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:22:35,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:22:35,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:22:35,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:22:35,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:22:35,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:22:35,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:22:35,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:22:35,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-21 16:22:35,507 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:22:35,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:22:35,507 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:22:35,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:22:35,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:22:35,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:22:35,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:22:35,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:22:35,510 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:22:35,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:22:35,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:22:35,511 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:22:35,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:22:35,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:22:35,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:22:35,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:22:35,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:22:35,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:22:35,512 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-21 16:22:35,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:22:35,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:22:35,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:22:35,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:22:35,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:22:35,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:22:35,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:22:35,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:22:35,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:22:35,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:22:35,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:22:35,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:22:35,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:22:35,516 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:22:35,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:22:35,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:22:35,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/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_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a 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 -> dd8583a115904a75c64c276a67bc1fecbbb0d70873f2ea75f8f51b865297f64f [2022-11-21 16:22:35,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:22:35,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:22:35,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:22:35,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:22:35,771 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:22:35,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread/fib_unsafe-11-racy.i [2022-11-21 16:22:38,899 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:22:39,182 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:22:39,183 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i [2022-11-21 16:22:39,200 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/data/e46f761e8/e2aeaae1dd2f447db4b96e536f7e16a8/FLAGed23f74e2 [2022-11-21 16:22:39,223 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/data/e46f761e8/e2aeaae1dd2f447db4b96e536f7e16a8 [2022-11-21 16:22:39,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:22:39,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:22:39,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:22:39,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:22:39,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:22:39,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25357117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39, skipping insertion in model container [2022-11-21 16:22:39,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:22:39,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:22:39,727 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_d2fd6401-1f4c-4e37-a591-bd731b47974d/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i[30813,30826] [2022-11-21 16:22:39,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:22:39,739 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:22:39,801 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_d2fd6401-1f4c-4e37-a591-bd731b47974d/sv-benchmarks/c/pthread/fib_unsafe-11-racy.i[30813,30826] [2022-11-21 16:22:39,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:22:39,841 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:22:39,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39 WrapperNode [2022-11-21 16:22:39,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:22:39,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:22:39,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:22:39,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:22:39,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,920 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-21 16:22:39,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:22:39,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:22:39,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:22:39,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:22:39,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,950 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:22:39,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:22:39,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:22:39,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:22:39,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (1/1) ... [2022-11-21 16:22:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:22:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:40,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:22:40,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:22:40,066 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-21 16:22:40,066 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-21 16:22:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-21 16:22:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-21 16:22:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:22:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:22:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:22:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:22:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:22:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:22:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:22:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:22:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:22:40,070 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:22:40,286 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:22:40,293 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:22:40,639 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:22:40,713 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:22:40,714 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:22:40,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:22:40 BoogieIcfgContainer [2022-11-21 16:22:40,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:22:40,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:22:40,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:22:40,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:22:40,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:22:39" (1/3) ... [2022-11-21 16:22:40,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a05dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:22:40, skipping insertion in model container [2022-11-21 16:22:40,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:22:39" (2/3) ... [2022-11-21 16:22:40,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a05dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:22:40, skipping insertion in model container [2022-11-21 16:22:40,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:22:40" (3/3) ... [2022-11-21 16:22:40,736 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11-racy.i [2022-11-21 16:22:40,746 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:22:40,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:22:40,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-21 16:22:40,758 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:22:40,878 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:22:40,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-21 16:22:41,074 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-21 16:22:41,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 366 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-11-21 16:22:41,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 396 flow [2022-11-21 16:22:41,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 191 transitions, 388 flow [2022-11-21 16:22:41,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:22:41,124 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;@568d629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:22:41,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-21 16:22:41,138 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-21 16:22:41,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:41,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:41,139 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:41,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377174, now seen corresponding path program 1 times [2022-11-21 16:22:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:41,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61231930] [2022-11-21 16:22:41,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:41,416 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-21 16:22:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:41,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61231930] [2022-11-21 16:22:41,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61231930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:41,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:41,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:22:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954815614] [2022-11-21 16:22:41,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:41,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:22:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:41,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:22:41,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:22:41,462 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 193 [2022-11-21 16:22:41,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 191 transitions, 388 flow. Second operand has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:41,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 193 [2022-11-21 16:22:41,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:41,555 INFO L130 PetriNetUnfolder]: 9/295 cut-off events. [2022-11-21 16:22:41,555 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:22:41,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 295 events. 9/295 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 939 event pairs, 2 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 274. Up to 11 conditions per place. [2022-11-21 16:22:41,563 INFO L137 encePairwiseOnDemand]: 181/193 looper letters, 6 selfloop transitions, 0 changer transitions 0/178 dead transitions. [2022-11-21 16:22:41,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 374 flow [2022-11-21 16:22:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:22:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:22:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-11-21 16:22:41,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9481865284974094 [2022-11-21 16:22:41,578 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2022-11-21 16:22:41,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2022-11-21 16:22:41,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:41,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2022-11-21 16:22:41,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,593 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,595 INFO L175 Difference]: Start difference. First operand has 190 places, 191 transitions, 388 flow. Second operand 2 states and 366 transitions. [2022-11-21 16:22:41,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 374 flow [2022-11-21 16:22:41,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:41,603 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 360 flow [2022-11-21 16:22:41,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=180, PETRI_TRANSITIONS=178} [2022-11-21 16:22:41,609 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -10 predicate places. [2022-11-21 16:22:41,610 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 360 flow [2022-11-21 16:22:41,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,610 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:41,610 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:41,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:22:41,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -929261081, now seen corresponding path program 1 times [2022-11-21 16:22:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:41,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866759730] [2022-11-21 16:22:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866759730] [2022-11-21 16:22:41,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866759730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:41,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:41,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805755146] [2022-11-21 16:22:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:41,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:41,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:41,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:22:41,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 178 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:41,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:22:41,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:41,911 INFO L130 PetriNetUnfolder]: 48/393 cut-off events. [2022-11-21 16:22:41,912 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:41,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 393 events. 48/393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1813 event pairs, 14 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 511. Up to 77 conditions per place. [2022-11-21 16:22:41,921 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 19 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2022-11-21 16:22:41,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 406 flow [2022-11-21 16:22:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-21 16:22:41,924 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8670120898100173 [2022-11-21 16:22:41,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-21 16:22:41,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-21 16:22:41,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:41,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-21 16:22:41,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,931 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 360 flow. Second operand 3 states and 502 transitions. [2022-11-21 16:22:41,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 406 flow [2022-11-21 16:22:41,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 179 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:22:41,935 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 362 flow [2022-11-21 16:22:41,936 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2022-11-21 16:22:41,936 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -9 predicate places. [2022-11-21 16:22:41,937 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 362 flow [2022-11-21 16:22:41,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:41,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:41,938 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:41,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:22:41,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:41,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837375, now seen corresponding path program 1 times [2022-11-21 16:22:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:41,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478926283] [2022-11-21 16:22:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478926283] [2022-11-21 16:22:42,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478926283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:42,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:42,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558296434] [2022-11-21 16:22:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:42,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:42,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:42,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:42,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:22:42,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:42,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:22:42,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:42,098 INFO L130 PetriNetUnfolder]: 34/261 cut-off events. [2022-11-21 16:22:42,099 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:22:42,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 261 events. 34/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 975 event pairs, 11 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 354. Up to 34 conditions per place. [2022-11-21 16:22:42,104 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2022-11-21 16:22:42,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 177 transitions, 398 flow [2022-11-21 16:22:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-21 16:22:42,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-21 16:22:42,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-21 16:22:42,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-21 16:22:42,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:42,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-21 16:22:42,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,114 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 362 flow. Second operand 3 states and 505 transitions. [2022-11-21 16:22:42,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 177 transitions, 398 flow [2022-11-21 16:22:42,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 177 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:42,120 INFO L231 Difference]: Finished difference. Result has 179 places, 175 transitions, 358 flow [2022-11-21 16:22:42,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-11-21 16:22:42,121 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-21 16:22:42,122 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 358 flow [2022-11-21 16:22:42,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,122 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:42,122 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:22:42,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -418600324, now seen corresponding path program 1 times [2022-11-21 16:22:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:42,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206735875] [2022-11-21 16:22:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,191 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-21 16:22:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:42,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206735875] [2022-11-21 16:22:42,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206735875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:42,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:42,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675564626] [2022-11-21 16:22:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:42,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:42,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:42,195 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:22:42,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:42,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:22:42,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:42,292 INFO L130 PetriNetUnfolder]: 22/303 cut-off events. [2022-11-21 16:22:42,292 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:42,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 303 events. 22/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1161 event pairs, 13 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2022-11-21 16:22:42,298 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 18 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-21 16:22:42,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 398 flow [2022-11-21 16:22:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-11-21 16:22:42,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8652849740932642 [2022-11-21 16:22:42,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-11-21 16:22:42,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-11-21 16:22:42,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:42,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-11-21 16:22:42,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,309 INFO L175 Difference]: Start difference. First operand has 179 places, 175 transitions, 358 flow. Second operand 3 states and 501 transitions. [2022-11-21 16:22:42,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 398 flow [2022-11-21 16:22:42,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 175 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:42,314 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 356 flow [2022-11-21 16:22:42,315 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2022-11-21 16:22:42,316 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -12 predicate places. [2022-11-21 16:22:42,321 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 356 flow [2022-11-21 16:22:42,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:42,325 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:42,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:22:42,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2063316520, now seen corresponding path program 1 times [2022-11-21 16:22:42,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:42,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046359393] [2022-11-21 16:22:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:42,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,421 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-21 16:22:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046359393] [2022-11-21 16:22:42,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046359393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:42,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:42,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:42,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286133123] [2022-11-21 16:22:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:42,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:42,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:42,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:22:42,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:42,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:22:42,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:42,506 INFO L130 PetriNetUnfolder]: 18/295 cut-off events. [2022-11-21 16:22:42,506 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:22:42,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 295 events. 18/295 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1099 event pairs, 6 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 342. Up to 23 conditions per place. [2022-11-21 16:22:42,511 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-21 16:22:42,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 386 flow [2022-11-21 16:22:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-21 16:22:42,513 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-21 16:22:42,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-21 16:22:42,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-21 16:22:42,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:42,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-21 16:22:42,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,517 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 356 flow. Second operand 3 states and 504 transitions. [2022-11-21 16:22:42,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 386 flow [2022-11-21 16:22:42,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 173 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:42,521 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 352 flow [2022-11-21 16:22:42,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2022-11-21 16:22:42,525 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -14 predicate places. [2022-11-21 16:22:42,525 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 352 flow [2022-11-21 16:22:42,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:42,526 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:42,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:22:42,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 940500773, now seen corresponding path program 1 times [2022-11-21 16:22:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909293232] [2022-11-21 16:22:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,603 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-21 16:22:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:42,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909293232] [2022-11-21 16:22:42,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909293232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:42,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:42,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708807038] [2022-11-21 16:22:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:42,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:42,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:42,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:42,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-21 16:22:42,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:42,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-21 16:22:42,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:42,766 INFO L130 PetriNetUnfolder]: 69/506 cut-off events. [2022-11-21 16:22:42,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:42,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 506 events. 69/506 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2804 event pairs, 50 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 638. Up to 107 conditions per place. [2022-11-21 16:22:42,773 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 20 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-21 16:22:42,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 398 flow [2022-11-21 16:22:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-21 16:22:42,775 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8635578583765112 [2022-11-21 16:22:42,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-21 16:22:42,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-21 16:22:42,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:42,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-21 16:22:42,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,780 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 352 flow. Second operand 3 states and 500 transitions. [2022-11-21 16:22:42,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 398 flow [2022-11-21 16:22:42,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 173 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:42,785 INFO L231 Difference]: Finished difference. Result has 175 places, 171 transitions, 350 flow [2022-11-21 16:22:42,785 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=171} [2022-11-21 16:22:42,788 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -15 predicate places. [2022-11-21 16:22:42,789 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 171 transitions, 350 flow [2022-11-21 16:22:42,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,789 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:42,790 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:42,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:22:42,790 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 193157200, now seen corresponding path program 1 times [2022-11-21 16:22:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:42,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833958445] [2022-11-21 16:22:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:42,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833958445] [2022-11-21 16:22:42,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833958445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:42,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:42,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034046619] [2022-11-21 16:22:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:42,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:42,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:42,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:22:42,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:42,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:42,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:22:42,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:42,998 INFO L130 PetriNetUnfolder]: 26/228 cut-off events. [2022-11-21 16:22:42,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:43,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 228 events. 26/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 802 event pairs, 16 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 312. Up to 49 conditions per place. [2022-11-21 16:22:43,002 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-11-21 16:22:43,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 390 flow [2022-11-21 16:22:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-11-21 16:22:43,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8618307426597582 [2022-11-21 16:22:43,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-11-21 16:22:43,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-11-21 16:22:43,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:43,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-11-21 16:22:43,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,010 INFO L175 Difference]: Start difference. First operand has 175 places, 171 transitions, 350 flow. Second operand 3 states and 499 transitions. [2022-11-21 16:22:43,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 390 flow [2022-11-21 16:22:43,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:43,013 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2022-11-21 16:22:43,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2022-11-21 16:22:43,014 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -16 predicate places. [2022-11-21 16:22:43,014 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2022-11-21 16:22:43,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,015 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:43,015 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:43,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:22:43,015 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1907786638, now seen corresponding path program 1 times [2022-11-21 16:22:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:43,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547155977] [2022-11-21 16:22:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:43,076 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-21 16:22:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:43,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547155977] [2022-11-21 16:22:43,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547155977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:43,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:43,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251583276] [2022-11-21 16:22:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:43,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:43,083 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:22:43,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:43,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:22:43,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:43,193 INFO L130 PetriNetUnfolder]: 49/471 cut-off events. [2022-11-21 16:22:43,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:43,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 471 events. 49/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2379 event pairs, 22 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 561. Up to 51 conditions per place. [2022-11-21 16:22:43,200 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-11-21 16:22:43,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 382 flow [2022-11-21 16:22:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-21 16:22:43,202 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-21 16:22:43,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-21 16:22:43,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-21 16:22:43,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:43,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-21 16:22:43,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,206 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 505 transitions. [2022-11-21 16:22:43,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 382 flow [2022-11-21 16:22:43,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:43,210 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2022-11-21 16:22:43,210 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2022-11-21 16:22:43,212 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-21 16:22:43,212 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2022-11-21 16:22:43,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,213 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:43,213 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:22:43,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 430848325, now seen corresponding path program 1 times [2022-11-21 16:22:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:43,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312044565] [2022-11-21 16:22:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:43,259 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-21 16:22:43,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:43,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312044565] [2022-11-21 16:22:43,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312044565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:43,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:43,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654504098] [2022-11-21 16:22:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:43,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:43,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:43,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:43,262 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-21 16:22:43,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:43,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-21 16:22:43,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:43,345 INFO L130 PetriNetUnfolder]: 49/491 cut-off events. [2022-11-21 16:22:43,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:43,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 491 events. 49/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2325 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 581. Up to 41 conditions per place. [2022-11-21 16:22:43,366 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 3 changer transitions 0/168 dead transitions. [2022-11-21 16:22:43,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 374 flow [2022-11-21 16:22:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-21 16:22:43,372 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-21 16:22:43,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:43,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,376 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 512 transitions. [2022-11-21 16:22:43,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 374 flow [2022-11-21 16:22:43,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:43,380 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 342 flow [2022-11-21 16:22:43,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2022-11-21 16:22:43,381 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-21 16:22:43,381 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 342 flow [2022-11-21 16:22:43,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:43,382 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:43,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:22:43,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1728395284, now seen corresponding path program 1 times [2022-11-21 16:22:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:43,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581265702] [2022-11-21 16:22:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:43,452 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-21 16:22:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:43,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581265702] [2022-11-21 16:22:43,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581265702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:43,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:43,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055098597] [2022-11-21 16:22:43,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:43,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:43,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:43,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:43,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-21 16:22:43,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:43,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-21 16:22:43,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:43,548 INFO L130 PetriNetUnfolder]: 47/481 cut-off events. [2022-11-21 16:22:43,548 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:43,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 481 events. 47/481 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1916 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 573. Up to 41 conditions per place. [2022-11-21 16:22:43,553 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-11-21 16:22:43,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 372 flow [2022-11-21 16:22:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-21 16:22:43,555 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-21 16:22:43,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:43,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,560 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 342 flow. Second operand 3 states and 512 transitions. [2022-11-21 16:22:43,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 372 flow [2022-11-21 16:22:43,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:43,564 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2022-11-21 16:22:43,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-21 16:22:43,565 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-21 16:22:43,566 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2022-11-21 16:22:43,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:43,566 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:43,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:22:43,568 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash -215926811, now seen corresponding path program 1 times [2022-11-21 16:22:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:43,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904751217] [2022-11-21 16:22:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:43,620 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-21 16:22:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904751217] [2022-11-21 16:22:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904751217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:43,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:43,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646023972] [2022-11-21 16:22:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:43,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:43,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:43,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:43,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:22:43,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:43,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:22:43,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:43,707 INFO L130 PetriNetUnfolder]: 18/278 cut-off events. [2022-11-21 16:22:43,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 278 events. 18/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 970 event pairs, 9 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 327. Up to 34 conditions per place. [2022-11-21 16:22:43,711 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:22:43,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 370 flow [2022-11-21 16:22:43,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-21 16:22:43,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8601036269430051 [2022-11-21 16:22:43,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-21 16:22:43,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-21 16:22:43,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:43,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-21 16:22:43,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,718 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 498 transitions. [2022-11-21 16:22:43,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 370 flow [2022-11-21 16:22:43,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:43,721 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 334 flow [2022-11-21 16:22:43,721 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-11-21 16:22:43,722 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:22:43,722 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 334 flow [2022-11-21 16:22:43,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,722 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:43,723 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:43,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:22:43,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1939820954, now seen corresponding path program 1 times [2022-11-21 16:22:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872576618] [2022-11-21 16:22:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:43,769 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-21 16:22:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:43,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872576618] [2022-11-21 16:22:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872576618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:43,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:43,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405326831] [2022-11-21 16:22:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:43,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:43,772 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-21 16:22:43,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:43,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-21 16:22:43,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:43,847 INFO L130 PetriNetUnfolder]: 45/451 cut-off events. [2022-11-21 16:22:43,848 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:43,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 451 events. 45/451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2261 event pairs, 26 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 535. Up to 59 conditions per place. [2022-11-21 16:22:43,852 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:22:43,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 368 flow [2022-11-21 16:22:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-21 16:22:43,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-21 16:22:43,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:43,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-21 16:22:43,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,858 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 334 flow. Second operand 3 states and 512 transitions. [2022-11-21 16:22:43,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 368 flow [2022-11-21 16:22:43,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:43,862 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2022-11-21 16:22:43,862 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2022-11-21 16:22:43,863 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-21 16:22:43,863 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2022-11-21 16:22:43,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:43,864 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:22:43,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1602304185, now seen corresponding path program 1 times [2022-11-21 16:22:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:43,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846079945] [2022-11-21 16:22:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:43,960 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-21 16:22:43,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:43,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846079945] [2022-11-21 16:22:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846079945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:43,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:43,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:22:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146079018] [2022-11-21 16:22:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:43,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-21 16:22:43,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:43,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:43,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-21 16:22:43,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:44,068 INFO L130 PetriNetUnfolder]: 41/577 cut-off events. [2022-11-21 16:22:44,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:44,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 577 events. 41/577 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2593 event pairs, 14 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 670. Up to 37 conditions per place. [2022-11-21 16:22:44,074 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2022-11-21 16:22:44,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 167 transitions, 376 flow [2022-11-21 16:22:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-11-21 16:22:44,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9015544041450777 [2022-11-21 16:22:44,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-11-21 16:22:44,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-11-21 16:22:44,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:44,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-11-21 16:22:44,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,079 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 522 transitions. [2022-11-21 16:22:44,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 167 transitions, 376 flow [2022-11-21 16:22:44,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:44,083 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 340 flow [2022-11-21 16:22:44,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-11-21 16:22:44,084 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:22:44,084 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 340 flow [2022-11-21 16:22:44,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:44,085 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:22:44,085 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash -596713196, now seen corresponding path program 1 times [2022-11-21 16:22:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:44,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608655278] [2022-11-21 16:22:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:44,118 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-21 16:22:44,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608655278] [2022-11-21 16:22:44,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608655278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:44,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:44,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050066267] [2022-11-21 16:22:44,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:44,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:44,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:44,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:22:44,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:44,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:22:44,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:44,221 INFO L130 PetriNetUnfolder]: 73/603 cut-off events. [2022-11-21 16:22:44,222 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:22:44,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 603 events. 73/603 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2986 event pairs, 46 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 756. Up to 99 conditions per place. [2022-11-21 16:22:44,228 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:22:44,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-21 16:22:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-21 16:22:44,230 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-21 16:22:44,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-21 16:22:44,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-21 16:22:44,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:44,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-21 16:22:44,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,234 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 340 flow. Second operand 3 states and 504 transitions. [2022-11-21 16:22:44,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-21 16:22:44,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:22:44,237 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 340 flow [2022-11-21 16:22:44,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-21 16:22:44,238 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:22:44,238 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 340 flow [2022-11-21 16:22:44,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:44,239 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:44,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:22:44,239 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash 187265853, now seen corresponding path program 1 times [2022-11-21 16:22:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:44,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100047819] [2022-11-21 16:22:44,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100047819] [2022-11-21 16:22:44,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100047819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:44,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:44,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144627770] [2022-11-21 16:22:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:44,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:44,276 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-21 16:22:44,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:44,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-21 16:22:44,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:44,366 INFO L130 PetriNetUnfolder]: 61/583 cut-off events. [2022-11-21 16:22:44,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:44,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 583 events. 61/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2565 event pairs, 18 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 708. Up to 51 conditions per place. [2022-11-21 16:22:44,372 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:22:44,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2022-11-21 16:22:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-11-21 16:22:44,374 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946459412780656 [2022-11-21 16:22:44,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-11-21 16:22:44,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-11-21 16:22:44,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:44,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-11-21 16:22:44,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,378 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 340 flow. Second operand 3 states and 518 transitions. [2022-11-21 16:22:44,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2022-11-21 16:22:44,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:44,381 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 344 flow [2022-11-21 16:22:44,382 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-21 16:22:44,382 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:22:44,382 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 344 flow [2022-11-21 16:22:44,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:44,383 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:44,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:22:44,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1490312150, now seen corresponding path program 1 times [2022-11-21 16:22:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:44,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020680794] [2022-11-21 16:22:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:44,433 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-21 16:22:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020680794] [2022-11-21 16:22:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020680794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527545687] [2022-11-21 16:22:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:44,436 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:22:44,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:44,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:22:44,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:44,540 INFO L130 PetriNetUnfolder]: 81/595 cut-off events. [2022-11-21 16:22:44,541 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-21 16:22:44,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 595 events. 81/595 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2997 event pairs, 54 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 780. Up to 115 conditions per place. [2022-11-21 16:22:44,546 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2022-11-21 16:22:44,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 380 flow [2022-11-21 16:22:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-21 16:22:44,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-21 16:22:44,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-21 16:22:44,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-21 16:22:44,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:44,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-21 16:22:44,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,552 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 344 flow. Second operand 3 states and 504 transitions. [2022-11-21 16:22:44,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 380 flow [2022-11-21 16:22:44,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 163 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:22:44,556 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 344 flow [2022-11-21 16:22:44,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2022-11-21 16:22:44,557 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:22:44,557 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 344 flow [2022-11-21 16:22:44,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:44,558 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:44,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:22:44,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash -91697017, now seen corresponding path program 1 times [2022-11-21 16:22:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096543719] [2022-11-21 16:22:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:44,596 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-21 16:22:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:44,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096543719] [2022-11-21 16:22:44,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096543719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:44,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:22:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608499836] [2022-11-21 16:22:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:44,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:22:44,598 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-21 16:22:44,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:44,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-21 16:22:44,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:44,707 INFO L130 PetriNetUnfolder]: 73/583 cut-off events. [2022-11-21 16:22:44,707 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:44,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 583 events. 73/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2779 event pairs, 54 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 764. Up to 115 conditions per place. [2022-11-21 16:22:44,713 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2022-11-21 16:22:44,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 384 flow [2022-11-21 16:22:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-21 16:22:44,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8583765112262521 [2022-11-21 16:22:44,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-21 16:22:44,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-21 16:22:44,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:44,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-21 16:22:44,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,719 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 344 flow. Second operand 3 states and 497 transitions. [2022-11-21 16:22:44,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 384 flow [2022-11-21 16:22:44,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:44,723 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 342 flow [2022-11-21 16:22:44,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-11-21 16:22:44,723 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-21 16:22:44,724 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 342 flow [2022-11-21 16:22:44,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:44,724 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:44,724 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:44,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:22:44,725 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:44,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1186677298, now seen corresponding path program 1 times [2022-11-21 16:22:44,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:44,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347647683] [2022-11-21 16:22:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347647683] [2022-11-21 16:22:44,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347647683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:22:44,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806711912] [2022-11-21 16:22:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:44,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:44,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:22:44,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:22:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:44,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:22:44,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:22:45,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:22:45,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806711912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:45,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:22:45,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-21 16:22:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858691440] [2022-11-21 16:22:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:45,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:45,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:22:45,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-21 16:22:45,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:45,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-21 16:22:45,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:45,140 INFO L130 PetriNetUnfolder]: 36/496 cut-off events. [2022-11-21 16:22:45,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:22:45,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 496 events. 36/496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1865 event pairs, 1 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 574. Up to 31 conditions per place. [2022-11-21 16:22:45,146 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 9 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-11-21 16:22:45,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-21 16:22:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-11-21 16:22:45,148 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9101899827288429 [2022-11-21 16:22:45,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-11-21 16:22:45,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-11-21 16:22:45,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:45,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-11-21 16:22:45,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,153 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 342 flow. Second operand 3 states and 527 transitions. [2022-11-21 16:22:45,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-21 16:22:45,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:45,157 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 372 flow [2022-11-21 16:22:45,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-21 16:22:45,158 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-21 16:22:45,158 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 372 flow [2022-11-21 16:22:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:45,159 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:45,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:22:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:22:45,366 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -359410964, now seen corresponding path program 1 times [2022-11-21 16:22:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:45,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530525786] [2022-11-21 16:22:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530525786] [2022-11-21 16:22:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530525786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:22:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080233612] [2022-11-21 16:22:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:45,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:45,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:22:45,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:22:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:22:45,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:22:45,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:22:45,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080233612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:45,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:22:45,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-21 16:22:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589722434] [2022-11-21 16:22:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:45,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:22:45,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:45,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:22:45,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:22:45,617 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-21 16:22:45,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:45,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-21 16:22:45,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:45,729 INFO L130 PetriNetUnfolder]: 78/616 cut-off events. [2022-11-21 16:22:45,729 INFO L131 PetriNetUnfolder]: For 138/151 co-relation queries the response was YES. [2022-11-21 16:22:45,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 616 events. 78/616 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2825 event pairs, 0 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 880. Up to 59 conditions per place. [2022-11-21 16:22:45,738 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2022-11-21 16:22:45,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 436 flow [2022-11-21 16:22:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:22:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:22:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-11-21 16:22:45,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9119170984455959 [2022-11-21 16:22:45,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-11-21 16:22:45,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-11-21 16:22:45,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:45,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-11-21 16:22:45,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,745 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 372 flow. Second operand 3 states and 528 transitions. [2022-11-21 16:22:45,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 171 transitions, 436 flow [2022-11-21 16:22:45,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:45,749 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 422 flow [2022-11-21 16:22:45,750 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=170, PETRI_TRANSITIONS=170} [2022-11-21 16:22:45,750 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-21 16:22:45,750 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 422 flow [2022-11-21 16:22:45,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:45,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:45,751 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:45,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:22:45,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:45,957 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -598637021, now seen corresponding path program 1 times [2022-11-21 16:22:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:45,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772746966] [2022-11-21 16:22:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772746966] [2022-11-21 16:22:46,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772746966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:22:46,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313469636] [2022-11-21 16:22:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:46,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:46,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:22:46,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:22:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:22:46,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:46,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:22:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:46,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313469636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:22:46,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:22:46,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 16:22:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631396151] [2022-11-21 16:22:46,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:22:46,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:22:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:46,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:22:46,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:22:46,441 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:22:46,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 170 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:46,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:46,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:22:46,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:46,792 INFO L130 PetriNetUnfolder]: 232/1316 cut-off events. [2022-11-21 16:22:46,792 INFO L131 PetriNetUnfolder]: For 997/1025 co-relation queries the response was YES. [2022-11-21 16:22:46,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 1316 events. 232/1316 cut-off events. For 997/1025 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6533 event pairs, 13 based on Foata normal form. 16/1275 useless extension candidates. Maximal degree in co-relation 2312. Up to 133 conditions per place. [2022-11-21 16:22:46,813 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 62 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-21 16:22:46,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 220 transitions, 876 flow [2022-11-21 16:22:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:22:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:22:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1533 transitions. [2022-11-21 16:22:46,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2022-11-21 16:22:46,817 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1533 transitions. [2022-11-21 16:22:46,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1533 transitions. [2022-11-21 16:22:46,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:46,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1533 transitions. [2022-11-21 16:22:46,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.33333333333334) internal successors, (1533), 9 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:46,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:46,826 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:46,826 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 422 flow. Second operand 9 states and 1533 transitions. [2022-11-21 16:22:46,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 220 transitions, 876 flow [2022-11-21 16:22:46,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 220 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:22:46,832 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 460 flow [2022-11-21 16:22:46,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2022-11-21 16:22:46,833 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-21 16:22:46,833 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 460 flow [2022-11-21 16:22:46,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:46,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:46,835 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:46,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:22:47,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:47,042 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash 327415809, now seen corresponding path program 2 times [2022-11-21 16:22:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:47,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254672022] [2022-11-21 16:22:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:47,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254672022] [2022-11-21 16:22:47,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254672022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:22:47,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680188210] [2022-11-21 16:22:47,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:22:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:47,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:22:47,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:22:47,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:22:47,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:22:47,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:22:47,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:47,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:22:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:47,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680188210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:22:47,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:22:47,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-21 16:22:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280770003] [2022-11-21 16:22:47,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:22:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 16:22:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:47,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 16:22:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:22:47,965 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:22:47,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 460 flow. Second operand has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:47,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:47,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:22:47,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:48,748 INFO L130 PetriNetUnfolder]: 392/2176 cut-off events. [2022-11-21 16:22:48,748 INFO L131 PetriNetUnfolder]: For 1508/1536 co-relation queries the response was YES. [2022-11-21 16:22:48,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 2176 events. 392/2176 cut-off events. For 1508/1536 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10625 event pairs, 13 based on Foata normal form. 26/2143 useless extension candidates. Maximal degree in co-relation 3882. Up to 213 conditions per place. [2022-11-21 16:22:48,778 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 138 selfloop transitions, 21 changer transitions 0/308 dead transitions. [2022-11-21 16:22:48,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 308 transitions, 1558 flow [2022-11-21 16:22:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:22:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-21 16:22:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3567 transitions. [2022-11-21 16:22:48,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8800888230940045 [2022-11-21 16:22:48,787 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3567 transitions. [2022-11-21 16:22:48,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3567 transitions. [2022-11-21 16:22:48,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:48,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3567 transitions. [2022-11-21 16:22:48,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 169.85714285714286) internal successors, (3567), 21 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:48,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:48,808 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:48,808 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 460 flow. Second operand 21 states and 3567 transitions. [2022-11-21 16:22:48,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 308 transitions, 1558 flow [2022-11-21 16:22:48,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 308 transitions, 1544 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-21 16:22:48,818 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 584 flow [2022-11-21 16:22:48,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=584, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2022-11-21 16:22:48,819 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 13 predicate places. [2022-11-21 16:22:48,819 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 584 flow [2022-11-21 16:22:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:48,820 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:48,820 INFO L209 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:48,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:22:49,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:49,027 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1096529341, now seen corresponding path program 3 times [2022-11-21 16:22:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:49,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349434240] [2022-11-21 16:22:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:49,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:49,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349434240] [2022-11-21 16:22:49,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349434240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:22:49,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933206192] [2022-11-21 16:22:49,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:22:49,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:49,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:22:49,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:22:49,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-21 16:22:49,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:22:49,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:22:49,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:50,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:22:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:51,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933206192] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:22:51,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:22:51,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-21 16:22:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538922279] [2022-11-21 16:22:51,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:22:51,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 16:22:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:51,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 16:22:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-21 16:22:51,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:22:51,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 584 flow. Second operand has 34 states, 34 states have (on average 168.08823529411765) internal successors, (5715), 34 states have internal predecessors, (5715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:51,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:51,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:22:51,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:22:53,175 INFO L130 PetriNetUnfolder]: 712/3896 cut-off events. [2022-11-21 16:22:53,175 INFO L131 PetriNetUnfolder]: For 4546/4574 co-relation queries the response was YES. [2022-11-21 16:22:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 3896 events. 712/3896 cut-off events. For 4546/4574 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 18635 event pairs, 13 based on Foata normal form. 46/3883 useless extension candidates. Maximal degree in co-relation 7428. Up to 373 conditions per place. [2022-11-21 16:22:53,232 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 290 selfloop transitions, 45 changer transitions 0/484 dead transitions. [2022-11-21 16:22:53,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 484 transitions, 3090 flow [2022-11-21 16:22:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-21 16:22:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-21 16:22:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7635 transitions. [2022-11-21 16:22:53,249 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2022-11-21 16:22:53,249 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 7635 transitions. [2022-11-21 16:22:53,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 7635 transitions. [2022-11-21 16:22:53,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:22:53,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 7635 transitions. [2022-11-21 16:22:53,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 169.66666666666666) internal successors, (7635), 45 states have internal predecessors, (7635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:53,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:53,293 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:53,293 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 584 flow. Second operand 45 states and 7635 transitions. [2022-11-21 16:22:53,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 484 transitions, 3090 flow [2022-11-21 16:22:53,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 484 transitions, 3050 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-21 16:22:53,309 INFO L231 Difference]: Finished difference. Result has 250 places, 214 transitions, 862 flow [2022-11-21 16:22:53,309 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=862, PETRI_PLACES=250, PETRI_TRANSITIONS=214} [2022-11-21 16:22:53,310 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 60 predicate places. [2022-11-21 16:22:53,310 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 214 transitions, 862 flow [2022-11-21 16:22:53,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 168.08823529411765) internal successors, (5715), 34 states have internal predecessors, (5715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:53,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:22:53,312 INFO L209 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:22:53,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:22:53,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 16:22:53,519 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:22:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1622679613, now seen corresponding path program 4 times [2022-11-21 16:22:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:53,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802545676] [2022-11-21 16:22:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802545676] [2022-11-21 16:22:55,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802545676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:22:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366274601] [2022-11-21 16:22:55,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:22:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:22:55,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:22:55,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:22:55,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:22:55,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:22:55,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 16:22:55,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:56,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:22:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:22:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366274601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:22:58,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:22:58,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2022-11-21 16:22:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205273180] [2022-11-21 16:22:58,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:22:58,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-21 16:22:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 16:22:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2022-11-21 16:22:58,426 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:22:58,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 214 transitions, 862 flow. Second operand has 51 states, 51 states have (on average 168.09803921568627) internal successors, (8573), 51 states have internal predecessors, (8573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:22:58,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:22:58,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:22:58,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:23:02,753 INFO L130 PetriNetUnfolder]: 1072/5831 cut-off events. [2022-11-21 16:23:02,754 INFO L131 PetriNetUnfolder]: For 12425/12453 co-relation queries the response was YES. [2022-11-21 16:23:02,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11763 conditions, 5831 events. 1072/5831 cut-off events. For 12425/12453 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 27705 event pairs, 13 based on Foata normal form. 51/5823 useless extension candidates. Maximal degree in co-relation 11739. Up to 553 conditions per place. [2022-11-21 16:23:02,858 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 461 selfloop transitions, 72 changer transitions 0/682 dead transitions. [2022-11-21 16:23:02,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 682 transitions, 4942 flow [2022-11-21 16:23:02,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-21 16:23:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-11-21 16:23:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 12208 transitions. [2022-11-21 16:23:02,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8785261945883708 [2022-11-21 16:23:02,877 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 12208 transitions. [2022-11-21 16:23:02,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 12208 transitions. [2022-11-21 16:23:02,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:23:02,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 12208 transitions. [2022-11-21 16:23:02,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 169.55555555555554) internal successors, (12208), 72 states have internal predecessors, (12208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:02,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 193.0) internal successors, (14089), 73 states have internal predecessors, (14089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:02,930 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 193.0) internal successors, (14089), 73 states have internal predecessors, (14089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:02,931 INFO L175 Difference]: Start difference. First operand has 250 places, 214 transitions, 862 flow. Second operand 72 states and 12208 transitions. [2022-11-21 16:23:02,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 682 transitions, 4942 flow [2022-11-21 16:23:02,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 682 transitions, 4868 flow, removed 19 selfloop flow, removed 18 redundant places. [2022-11-21 16:23:02,958 INFO L231 Difference]: Finished difference. Result has 313 places, 242 transitions, 1244 flow [2022-11-21 16:23:02,958 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=1244, PETRI_PLACES=313, PETRI_TRANSITIONS=242} [2022-11-21 16:23:02,959 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 123 predicate places. [2022-11-21 16:23:02,959 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 242 transitions, 1244 flow [2022-11-21 16:23:02,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 168.09803921568627) internal successors, (8573), 51 states have internal predecessors, (8573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:23:02,962 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:23:02,962 INFO L209 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:02,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 16:23:03,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 16:23:03,169 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:23:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1000750044, now seen corresponding path program 5 times [2022-11-21 16:23:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213322537] [2022-11-21 16:23:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:23:03,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:23:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:23:03,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:23:03,943 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:23:03,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-21 16:23:03,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-21 16:23:03,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-21 16:23:03,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-21 16:23:03,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-21 16:23:03,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-21 16:23:03,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-21 16:23:03,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-21 16:23:03,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-21 16:23:03,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-21 16:23:03,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-21 16:23:03,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-21 16:23:03,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-21 16:23:03,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-21 16:23:03,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-21 16:23:03,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-21 16:23:03,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-21 16:23:03,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-21 16:23:03,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-21 16:23:03,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-21 16:23:03,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-21 16:23:03,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-21 16:23:03,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-21 16:23:03,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-21 16:23:03,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-21 16:23:03,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-21 16:23:03,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-21 16:23:03,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-21 16:23:03,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-21 16:23:03,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-21 16:23:03,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-21 16:23:03,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-21 16:23:03,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-21 16:23:03,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-21 16:23:03,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-21 16:23:03,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-21 16:23:03,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-21 16:23:03,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-21 16:23:03,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-21 16:23:03,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-21 16:23:03,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-21 16:23:03,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-21 16:23:03,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-21 16:23:03,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-21 16:23:03,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-21 16:23:03,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-21 16:23:03,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 16:23:03,955 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:23:03,966 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:23:03,966 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:23:04,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:23:04 BasicIcfg [2022-11-21 16:23:04,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:23:04,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:23:04,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:23:04,340 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:23:04,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:22:40" (3/4) ... [2022-11-21 16:23:04,353 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:23:04,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:23:04,354 INFO L158 Benchmark]: Toolchain (without parser) took 25125.17ms. Allocated memory was 138.4MB in the beginning and 564.1MB in the end (delta: 425.7MB). Free memory was 75.8MB in the beginning and 145.0MB in the end (delta: -69.2MB). Peak memory consumption was 358.6MB. Max. memory is 16.1GB. [2022-11-21 16:23:04,354 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:23:04,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.12ms. Allocated memory is still 138.4MB. Free memory was 75.3MB in the beginning and 55.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-21 16:23:04,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.32ms. Allocated memory is still 138.4MB. Free memory was 55.5MB in the beginning and 53.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:23:04,355 INFO L158 Benchmark]: Boogie Preprocessor took 33.44ms. Allocated memory is still 138.4MB. Free memory was 53.3MB in the beginning and 51.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:23:04,356 INFO L158 Benchmark]: RCFGBuilder took 761.49ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 51.8MB in the beginning and 128.4MB in the end (delta: -76.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-11-21 16:23:04,356 INFO L158 Benchmark]: TraceAbstraction took 23619.92ms. Allocated memory was 174.1MB in the beginning and 564.1MB in the end (delta: 390.1MB). Free memory was 127.4MB in the beginning and 145.0MB in the end (delta: -17.6MB). Peak memory consumption was 371.4MB. Max. memory is 16.1GB. [2022-11-21 16:23:04,356 INFO L158 Benchmark]: Witness Printer took 14.17ms. Allocated memory is still 564.1MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:23:04,358 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.29ms. Allocated memory is still 138.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.12ms. Allocated memory is still 138.4MB. Free memory was 75.3MB in the beginning and 55.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.32ms. Allocated memory is still 138.4MB. Free memory was 55.5MB in the beginning and 53.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.44ms. Allocated memory is still 138.4MB. Free memory was 53.3MB in the beginning and 51.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 761.49ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 51.8MB in the beginning and 128.4MB in the end (delta: -76.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23619.92ms. Allocated memory was 174.1MB in the beginning and 564.1MB in the end (delta: 390.1MB). Free memory was 127.4MB in the beginning and 145.0MB in the end (delta: -17.6MB). Peak memory consumption was 371.4MB. Max. memory is 16.1GB. * Witness Printer took 14.17ms. Allocated memory is still 564.1MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=75121, argc=75121, argv={75064:75082}, argv={75064:75082}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=75121, argc=75121, argv={75064:75082}, argv={75064:75082}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=75121, argc=75121, argv={75064:75082}, argv={75064:75082}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=75121, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=17711, q=0, x=22] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=28657, q=0, x=23] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND FALSE 0 !(x < 24) VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L711] 0 return prev; VAL [\result=46368, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, correct=46368, cur=75025, fib()=46368, i=1, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i < correct VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, correct=46368, cur=75025, i=1, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=2, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i < correct VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, correct=46368, cur=75025, i=2, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i < correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: 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: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: 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 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: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 46 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: 23.0s, OverallIterations: 24, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1395 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1395 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 979 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 152 mSDtfsCounter, 979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2772 GetRequests, 2538 SyntacticMatches, 15 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=23, InterpolantAutomatonStates: 203, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 4602 NumberOfCodeBlocks, 4602 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4852 ConstructedInterpolants, 0 QuantifiedInterpolants, 10696 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2700 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 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-21 16:23:05,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2fd6401-1f4c-4e37-a591-bd731b47974d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE