./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 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_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/condvar.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- 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-2329fc7 [2022-12-14 09:18:02,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:18:02,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:18:02,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:18:02,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:18:02,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:18:02,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:18:02,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:18:02,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:18:02,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:18:02,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:18:02,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:18:02,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:18:02,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:18:02,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:18:02,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:18:02,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:18:02,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:18:02,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:18:02,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:18:02,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:18:02,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:18:02,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:18:02,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:18:02,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:18:02,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:18:02,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:18:02,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:18:02,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:18:02,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:18:02,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:18:02,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:18:02,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:18:02,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:18:02,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:18:02,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:18:02,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:18:02,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:18:02,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:18:02,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:18:02,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:18:02,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 09:18:02,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:18:02,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:18:02,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:18:02,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:18:02,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:18:02,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:18:02,092 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:18:02,092 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:18:02,093 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:18:02,093 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:18:02,094 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:18:02,094 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:18:02,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:18:02,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:18:02,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:18:02,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:18:02,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:18:02,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:18:02,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:18:02,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:18:02,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:18:02,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:18:02,096 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:18:02,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:18:02,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:18:02,097 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:18:02,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:18:02,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:18:02,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:18:02,097 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_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/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_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2022-12-14 09:18:02,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:18:02,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:18:02,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:18:02,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:18:02,293 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:18:02,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-divine/condvar.i [2022-12-14 09:18:04,864 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:18:05,070 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:18:05,071 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/sv-benchmarks/c/pthread-divine/condvar.i [2022-12-14 09:18:05,078 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/data/294064aab/f9506df409a743cdb3939ce7a906ac9f/FLAGc2ead2c05 [2022-12-14 09:18:05,443 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/data/294064aab/f9506df409a743cdb3939ce7a906ac9f [2022-12-14 09:18:05,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:18:05,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:18:05,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:18:05,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:18:05,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:18:05,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3a8b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05, skipping insertion in model container [2022-12-14 09:18:05,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:18:05,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:18:05,578 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 09:18:05,705 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_9672634a-8fd9-48c7-a68d-9878569730a5/sv-benchmarks/c/pthread-divine/condvar.i[30458,30471] [2022-12-14 09:18:05,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:18:05,722 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:18:05,732 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 09:18:05,755 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_9672634a-8fd9-48c7-a68d-9878569730a5/sv-benchmarks/c/pthread-divine/condvar.i[30458,30471] [2022-12-14 09:18:05,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:18:05,799 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:18:05,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05 WrapperNode [2022-12-14 09:18:05,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:18:05,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:18:05,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:18:05,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:18:05,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,839 INFO L138 Inliner]: procedures = 169, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2022-12-14 09:18:05,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:18:05,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:18:05,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:18:05,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:18:05,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:18:05,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:18:05,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:18:05,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:18:05,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (1/1) ... [2022-12-14 09:18:05,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:18:05,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:18:05,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:18:05,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:18:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 09:18:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 09:18:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 09:18:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:18:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:18:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:18:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:18:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-12-14 09:18:05,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-12-14 09:18:05,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:18:05,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:18:05,930 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 09:18:06,030 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:18:06,032 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:18:06,194 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:18:06,201 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:18:06,201 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 09:18:06,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:18:06 BoogieIcfgContainer [2022-12-14 09:18:06,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:18:06,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:18:06,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:18:06,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:18:06,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:18:05" (1/3) ... [2022-12-14 09:18:06,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571338f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:18:06, skipping insertion in model container [2022-12-14 09:18:06,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:18:05" (2/3) ... [2022-12-14 09:18:06,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571338f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:18:06, skipping insertion in model container [2022-12-14 09:18:06,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:18:06" (3/3) ... [2022-12-14 09:18:06,212 INFO L112 eAbstractionObserver]: Analyzing ICFG condvar.i [2022-12-14 09:18:06,221 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 09:18:06,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:18:06,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-12-14 09:18:06,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 09:18:06,281 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-14 09:18:06,306 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 09:18:06,319 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 99 transitions, 206 flow [2022-12-14 09:18:06,322 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 99 transitions, 206 flow [2022-12-14 09:18:06,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 99 transitions, 206 flow [2022-12-14 09:18:06,370 INFO L130 PetriNetUnfolder]: 5/98 cut-off events. [2022-12-14 09:18:06,371 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-14 09:18:06,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 98 events. 5/98 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2022-12-14 09:18:06,376 INFO L119 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-14 09:18:08,857 INFO L134 LiptonReduction]: Checked pairs total: 2863 [2022-12-14 09:18:08,857 INFO L136 LiptonReduction]: Total number of compositions: 84 [2022-12-14 09:18:08,863 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 26 transitions, 60 flow [2022-12-14 09:18:08,879 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 90 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 89 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:08,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:18:08,900 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=FINITE_AUTOMATA, 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;@3d28206f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:18:08,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 09:18:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 89 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:18:08,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:08,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:18:08,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:08,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 10907457, now seen corresponding path program 1 times [2022-12-14 09:18:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:08,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518021283] [2022-12-14 09:18:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518021283] [2022-12-14 09:18:09,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518021283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:18:09,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 09:18:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147234641] [2022-12-14 09:18:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 09:18:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 09:18:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 09:18:09,059 INFO L87 Difference]: Start difference. First operand has 90 states, 79 states have (on average 2.4936708860759493) internal successors, (197), 89 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,085 INFO L93 Difference]: Finished difference Result 81 states and 160 transitions. [2022-12-14 09:18:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 09:18:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 09:18:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,094 INFO L225 Difference]: With dead ends: 81 [2022-12-14 09:18:09,094 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 09:18:09,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 09:18:09,097 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 09:18:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 09:18:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 2.191780821917808) internal successors, (160), 80 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 160 transitions. [2022-12-14 09:18:09,123 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 160 transitions. Word has length 4 [2022-12-14 09:18:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,124 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 160 transitions. [2022-12-14 09:18:09,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 160 transitions. [2022-12-14 09:18:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:18:09,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:18:09,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:18:09,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash 338123456, now seen corresponding path program 1 times [2022-12-14 09:18:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290017122] [2022-12-14 09:18:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290017122] [2022-12-14 09:18:09,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290017122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:18:09,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:18:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341581108] [2022-12-14 09:18:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:18:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:18:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,176 INFO L87 Difference]: Start difference. First operand 81 states and 160 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,208 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2022-12-14 09:18:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:18:09,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 09:18:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,210 INFO L225 Difference]: With dead ends: 100 [2022-12-14 09:18:09,210 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 09:18:09,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,211 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 09:18:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2022-12-14 09:18:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 2.183098591549296) internal successors, (155), 77 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 155 transitions. [2022-12-14 09:18:09,218 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 155 transitions. Word has length 5 [2022-12-14 09:18:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,218 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 155 transitions. [2022-12-14 09:18:09,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 155 transitions. [2022-12-14 09:18:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 09:18:09,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 09:18:09,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:18:09,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1892105453, now seen corresponding path program 1 times [2022-12-14 09:18:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184488084] [2022-12-14 09:18:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184488084] [2022-12-14 09:18:09,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184488084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:18:09,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:18:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584934319] [2022-12-14 09:18:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:18:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:18:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,255 INFO L87 Difference]: Start difference. First operand 78 states and 155 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,283 INFO L93 Difference]: Finished difference Result 78 states and 153 transitions. [2022-12-14 09:18:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:18:09,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 09:18:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,284 INFO L225 Difference]: With dead ends: 78 [2022-12-14 09:18:09,284 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 09:18:09,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,286 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 09:18:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-14 09:18:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 77 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 153 transitions. [2022-12-14 09:18:09,291 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 153 transitions. Word has length 6 [2022-12-14 09:18:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,291 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 153 transitions. [2022-12-14 09:18:09,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 153 transitions. [2022-12-14 09:18:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 09:18:09,292 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 09:18:09,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:18:09,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1892102108, now seen corresponding path program 1 times [2022-12-14 09:18:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724624164] [2022-12-14 09:18:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724624164] [2022-12-14 09:18:09,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724624164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:18:09,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:18:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914277219] [2022-12-14 09:18:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:18:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:18:09,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,332 INFO L87 Difference]: Start difference. First operand 78 states and 153 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,356 INFO L93 Difference]: Finished difference Result 110 states and 215 transitions. [2022-12-14 09:18:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:18:09,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 09:18:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,358 INFO L225 Difference]: With dead ends: 110 [2022-12-14 09:18:09,358 INFO L226 Difference]: Without dead ends: 110 [2022-12-14 09:18:09,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,359 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-14 09:18:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 86. [2022-12-14 09:18:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 2.1392405063291138) internal successors, (169), 85 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 169 transitions. [2022-12-14 09:18:09,365 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 169 transitions. Word has length 6 [2022-12-14 09:18:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,366 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 169 transitions. [2022-12-14 09:18:09,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 169 transitions. [2022-12-14 09:18:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 09:18:09,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:09,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:18:09,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1480864370, now seen corresponding path program 1 times [2022-12-14 09:18:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347948124] [2022-12-14 09:18:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347948124] [2022-12-14 09:18:09,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347948124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:18:09,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:18:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721145084] [2022-12-14 09:18:09,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:18:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:18:09,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,396 INFO L87 Difference]: Start difference. First operand 86 states and 169 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,424 INFO L93 Difference]: Finished difference Result 100 states and 190 transitions. [2022-12-14 09:18:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:18:09,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 09:18:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,426 INFO L225 Difference]: With dead ends: 100 [2022-12-14 09:18:09,426 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 09:18:09,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,427 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 09:18:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-12-14 09:18:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 2.0779220779220777) internal successors, (160), 82 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 160 transitions. [2022-12-14 09:18:09,432 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 160 transitions. Word has length 7 [2022-12-14 09:18:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,432 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 160 transitions. [2022-12-14 09:18:09,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 160 transitions. [2022-12-14 09:18:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 09:18:09,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:09,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:18:09,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 568491259, now seen corresponding path program 1 times [2022-12-14 09:18:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730070846] [2022-12-14 09:18:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730070846] [2022-12-14 09:18:09,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730070846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:18:09,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746741641] [2022-12-14 09:18:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:18:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:18:09,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:18:09,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:18:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:18:09,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:18:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:18:09,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:18:09,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746741641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:18:09,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 09:18:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658601249] [2022-12-14 09:18:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:18:09,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:18:09,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:18:09,546 INFO L87 Difference]: Start difference. First operand 83 states and 160 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,572 INFO L93 Difference]: Finished difference Result 83 states and 153 transitions. [2022-12-14 09:18:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:18:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 09:18:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,573 INFO L225 Difference]: With dead ends: 83 [2022-12-14 09:18:09,573 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 09:18:09,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:18:09,575 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 09:18:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-12-14 09:18:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 108 transitions. [2022-12-14 09:18:09,579 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 108 transitions. Word has length 9 [2022-12-14 09:18:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,580 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 108 transitions. [2022-12-14 09:18:09,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 108 transitions. [2022-12-14 09:18:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:18:09,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:09,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:18:09,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 09:18:09,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1252962565, now seen corresponding path program 1 times [2022-12-14 09:18:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419883676] [2022-12-14 09:18:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419883676] [2022-12-14 09:18:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419883676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:18:09,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:18:09,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:18:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244397442] [2022-12-14 09:18:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:18:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:18:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:18:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,924 INFO L87 Difference]: Start difference. First operand 63 states and 108 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:09,941 INFO L93 Difference]: Finished difference Result 42 states and 75 transitions. [2022-12-14 09:18:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:18:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 09:18:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:09,942 INFO L225 Difference]: With dead ends: 42 [2022-12-14 09:18:09,942 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 09:18:09,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:18:09,943 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:09,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 09:18:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-14 09:18:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 37 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 66 transitions. [2022-12-14 09:18:09,947 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 66 transitions. Word has length 10 [2022-12-14 09:18:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:09,947 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 66 transitions. [2022-12-14 09:18:09,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 66 transitions. [2022-12-14 09:18:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 09:18:09,948 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:09,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:09,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 09:18:09,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash 267398776, now seen corresponding path program 1 times [2022-12-14 09:18:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:09,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200267084] [2022-12-14 09:18:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:09,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:09,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200267084] [2022-12-14 09:18:09,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200267084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:18:09,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023245542] [2022-12-14 09:18:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:09,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:18:09,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:18:09,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:18:09,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:18:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:10,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:18:10,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:18:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:10,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:18:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:10,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023245542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:18:10,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1443240064] [2022-12-14 09:18:10,094 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 09:18:10,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:18:10,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 09:18:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504216447] [2022-12-14 09:18:10,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:18:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 09:18:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 09:18:10,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:18:10,105 INFO L87 Difference]: Start difference. First operand 38 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:10,146 INFO L93 Difference]: Finished difference Result 65 states and 120 transitions. [2022-12-14 09:18:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:18:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 09:18:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:10,147 INFO L225 Difference]: With dead ends: 65 [2022-12-14 09:18:10,147 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 09:18:10,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:18:10,148 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:10,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:18:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 09:18:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-14 09:18:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.9047619047619047) internal successors, (120), 64 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 120 transitions. [2022-12-14 09:18:10,153 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 120 transitions. Word has length 11 [2022-12-14 09:18:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:10,153 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 120 transitions. [2022-12-14 09:18:10,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 120 transitions. [2022-12-14 09:18:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 09:18:10,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:10,154 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:10,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:18:10,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 09:18:10,355 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash 367983763, now seen corresponding path program 2 times [2022-12-14 09:18:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:10,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636644093] [2022-12-14 09:18:10,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:10,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:10,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636644093] [2022-12-14 09:18:10,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636644093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:18:10,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534635637] [2022-12-14 09:18:10,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:18:10,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:18:10,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:18:10,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:18:10,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:18:10,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 09:18:10,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:18:10,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:18:10,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:18:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:10,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:18:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:10,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534635637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:18:10,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293817498] [2022-12-14 09:18:10,599 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 09:18:10,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:18:10,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-14 09:18:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022694517] [2022-12-14 09:18:10,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:18:10,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 09:18:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:10,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 09:18:10,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 09:18:10,602 INFO L87 Difference]: Start difference. First operand 65 states and 120 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:10,667 INFO L93 Difference]: Finished difference Result 119 states and 228 transitions. [2022-12-14 09:18:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:18:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 09:18:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:10,668 INFO L225 Difference]: With dead ends: 119 [2022-12-14 09:18:10,668 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 09:18:10,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 09:18:10,669 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 67 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:10,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 35 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:18:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 09:18:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-12-14 09:18:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.9487179487179487) internal successors, (228), 118 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 228 transitions. [2022-12-14 09:18:10,674 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 228 transitions. Word has length 20 [2022-12-14 09:18:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:10,674 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 228 transitions. [2022-12-14 09:18:10,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 228 transitions. [2022-12-14 09:18:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 09:18:10,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:10,676 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:10,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:18:10,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:18:10,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1486256691, now seen corresponding path program 3 times [2022-12-14 09:18:10,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:10,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903897344] [2022-12-14 09:18:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:11,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:11,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903897344] [2022-12-14 09:18:11,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903897344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:18:11,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994831476] [2022-12-14 09:18:11,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:18:11,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:18:11,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:18:11,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:18:11,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:18:11,080 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:18:11,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:18:11,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:18:11,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:18:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:11,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:18:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:11,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994831476] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:18:11,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1677442551] [2022-12-14 09:18:11,314 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 09:18:11,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:18:11,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-14 09:18:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797660337] [2022-12-14 09:18:11,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:18:11,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 09:18:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 09:18:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:18:11,317 INFO L87 Difference]: Start difference. First operand 119 states and 228 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:11,453 INFO L93 Difference]: Finished difference Result 227 states and 444 transitions. [2022-12-14 09:18:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 09:18:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-14 09:18:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:11,456 INFO L225 Difference]: With dead ends: 227 [2022-12-14 09:18:11,456 INFO L226 Difference]: Without dead ends: 227 [2022-12-14 09:18:11,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:18:11,457 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 178 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:11,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 66 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:18:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-12-14 09:18:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-12-14 09:18:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.9733333333333334) internal successors, (444), 226 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 444 transitions. [2022-12-14 09:18:11,468 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 444 transitions. Word has length 38 [2022-12-14 09:18:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:11,468 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 444 transitions. [2022-12-14 09:18:11,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 444 transitions. [2022-12-14 09:18:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 09:18:11,470 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:11,470 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:11,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:18:11,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 09:18:11,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 302447987, now seen corresponding path program 4 times [2022-12-14 09:18:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:11,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396844850] [2022-12-14 09:18:11,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:12,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:18:12,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396844850] [2022-12-14 09:18:12,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396844850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:18:12,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437166452] [2022-12-14 09:18:12,216 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 09:18:12,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:18:12,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:18:12,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:18:12,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:18:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:18:12,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 09:18:12,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:18:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:12,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:18:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:18:12,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437166452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:18:12,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112833606] [2022-12-14 09:18:12,863 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 09:18:12,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:18:12,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2022-12-14 09:18:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32574195] [2022-12-14 09:18:12,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:18:12,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 09:18:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:18:12,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 09:18:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 09:18:12,867 INFO L87 Difference]: Start difference. First operand 227 states and 444 transitions. Second operand has 46 states, 46 states have (on average 3.0434782608695654) internal successors, (140), 46 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:18:13,246 INFO L93 Difference]: Finished difference Result 416 states and 822 transitions. [2022-12-14 09:18:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 09:18:13,247 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.0434782608695654) internal successors, (140), 46 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-12-14 09:18:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:18:13,248 INFO L225 Difference]: With dead ends: 416 [2022-12-14 09:18:13,248 INFO L226 Difference]: Without dead ends: 416 [2022-12-14 09:18:13,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 09:18:13,249 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 350 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:18:13,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 143 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:18:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-12-14 09:18:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-12-14 09:18:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 414 states have (on average 1.9855072463768115) internal successors, (822), 415 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 822 transitions. [2022-12-14 09:18:13,258 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 822 transitions. Word has length 74 [2022-12-14 09:18:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:18:13,259 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 822 transitions. [2022-12-14 09:18:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.0434782608695654) internal successors, (140), 46 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:18:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 822 transitions. [2022-12-14 09:18:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 09:18:13,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:18:13,262 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:13,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:18:13,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 09:18:13,464 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-12-14 09:18:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:18:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash 527252248, now seen corresponding path program 5 times [2022-12-14 09:18:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:18:13,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053033316] [2022-12-14 09:18:13,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:18:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:18:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:18:13,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 09:18:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:18:13,655 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 09:18:13,655 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 09:18:13,656 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-12-14 09:18:13,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-12-14 09:18:13,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-12-14 09:18:13,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2022-12-14 09:18:13,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-12-14 09:18:13,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-12-14 09:18:13,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-12-14 09:18:13,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-12-14 09:18:13,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 09:18:13,660 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:18:13,665 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 09:18:13,665 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:18:13,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:18:13 BasicIcfg [2022-12-14 09:18:13,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:18:13,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:18:13,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:18:13,726 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:18:13,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:18:06" (3/4) ... [2022-12-14 09:18:13,728 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 09:18:13,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:18:13,728 INFO L158 Benchmark]: Toolchain (without parser) took 8279.92ms. Allocated memory is still 176.2MB. Free memory was 140.3MB in the beginning and 45.2MB in the end (delta: 95.1MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2022-12-14 09:18:13,729 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:18:13,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.68ms. Allocated memory is still 176.2MB. Free memory was 140.3MB in the beginning and 120.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 09:18:13,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.21ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:18:13,729 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 176.2MB. Free memory was 118.4MB in the beginning and 116.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:18:13,729 INFO L158 Benchmark]: RCFGBuilder took 337.03ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 102.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 09:18:13,729 INFO L158 Benchmark]: TraceAbstraction took 7519.68ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 46.3MB in the end (delta: 55.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2022-12-14 09:18:13,730 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 176.2MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:18:13,731 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.19ms. Allocated memory is still 125.8MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.68ms. Allocated memory is still 176.2MB. Free memory was 140.3MB in the beginning and 120.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.21ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 176.2MB. Free memory was 118.4MB in the beginning and 116.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.03ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 102.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7519.68ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 46.3MB in the end (delta: 55.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 176.2MB. Free memory is still 45.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 98 PlacesBefore, 26 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 2863 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1818, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 908, independent: 867, independent conditional: 0, independent unconditional: 867, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 908, independent: 856, independent conditional: 0, independent unconditional: 856, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1818, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 908, unknown conditional: 0, unknown unconditional: 908] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 715]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; [L698] 0 pthread_cond_t cond; [L699] 0 int x; [L700] 0 _Bool x_set = 0; [L711] 0 pthread_t t; [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [arg={0:0}, cond={4:0}, lock={3:0}, pthread_create( &t, ((void *)0), thread, ((void *)0) )=-1, t={7:0}, x=0, x_set=0] [L713] 0 int i = 0; VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=1, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=2, lock={3:0}, t={7:0}, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=3, lock={3:0}, t={7:0}, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=4, lock={3:0}, t={7:0}, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=5, lock={3:0}, t={7:0}, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=6, lock={3:0}, t={7:0}, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=7, lock={3:0}, t={7:0}, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=8, lock={3:0}, t={7:0}, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=9, lock={3:0}, t={7:0}, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=10, lock={3:0}, t={7:0}, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=11, lock={3:0}, t={7:0}, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=12, lock={3:0}, t={7:0}, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=13, lock={3:0}, t={7:0}, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=14, lock={3:0}, t={7:0}, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=15, lock={3:0}, t={7:0}, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=16, lock={3:0}, t={7:0}, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=17, lock={3:0}, t={7:0}, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=18, lock={3:0}, t={7:0}, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=19, lock={3:0}, t={7:0}, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=20, lock={3:0}, t={7:0}, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=21, lock={3:0}, t={7:0}, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=22, lock={3:0}, t={7:0}, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=23, lock={3:0}, t={7:0}, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=24, lock={3:0}, t={7:0}, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=25, lock={3:0}, t={7:0}, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=26, lock={3:0}, t={7:0}, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=27, lock={3:0}, t={7:0}, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=28, lock={3:0}, t={7:0}, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=29, lock={3:0}, t={7:0}, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=30, lock={3:0}, t={7:0}, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=31, lock={3:0}, t={7:0}, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=32, lock={3:0}, t={7:0}, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=33, lock={3:0}, t={7:0}, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=34, lock={3:0}, t={7:0}, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=35, lock={3:0}, t={7:0}, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=36, lock={3:0}, t={7:0}, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=37, lock={3:0}, t={7:0}, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=38, lock={3:0}, t={7:0}, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=39, lock={3:0}, t={7:0}, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=40, lock={3:0}, t={7:0}, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=41, lock={3:0}, t={7:0}, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=42, lock={3:0}, t={7:0}, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 [L714] 0 x = i [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) [L715] 0 x_set = 1 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=1, x_set = 1=141] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=42, x_set=1] [L715] 0 x_set = 1 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=1, x_set = 1=141] Now there is a data race on ~x_set~0 between C: !x_set [704] and C: x_set = 1 [715] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 704]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 669 mSDsluCounter, 365 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 92 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=11, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 960 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 1/2651 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-12-14 09:18:13,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9672634a-8fd9-48c7-a68d-9878569730a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE