./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/indexer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/indexer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS --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 f24afaadf07ead7c7da85cf6020fd6a6a5b5585e439441b5111a2dea2e7cec4c --- 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-8393723 [2022-11-19 08:03:54,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:03:54,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:03:54,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:03:54,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:03:55,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:03:55,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:03:55,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:03:55,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:03:55,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:03:55,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:03:55,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:03:55,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:03:55,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:03:55,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:03:55,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:03:55,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:03:55,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:03:55,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:03:55,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:03:55,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:03:55,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:03:55,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:03:55,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:03:55,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:03:55,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:03:55,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:03:55,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:03:55,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:03:55,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:03:55,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:03:55,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:03:55,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:03:55,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:03:55,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:03:55,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:03:55,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:03:55,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:03:55,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:03:55,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:03:55,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:03:55,059 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-19 08:03:55,101 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:03:55,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:03:55,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:03:55,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:03:55,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:03:55,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:03:55,104 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:03:55,104 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:03:55,104 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:03:55,105 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:03:55,106 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:03:55,106 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:03:55,106 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:03:55,106 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:03:55,107 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:03:55,107 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:03:55,107 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:03:55,107 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:03:55,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:03:55,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:03:55,108 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:03:55,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:03:55,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:03:55,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:03:55,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:03:55,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:03:55,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:03:55,110 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-19 08:03:55,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:03:55,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:03:55,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:03:55,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:03:55,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:03:55,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:03:55,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:03:55,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:03:55,112 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:03:55,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:03:55,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:03:55,114 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:03:55,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:03:55,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:03:55,114 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:03:55,114 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_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/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_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS 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 -> f24afaadf07ead7c7da85cf6020fd6a6a5b5585e439441b5111a2dea2e7cec4c [2022-11-19 08:03:55,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:03:55,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:03:55,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:03:55,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:03:55,484 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:03:55,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread/indexer.i [2022-11-19 08:03:55,552 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/data/e28513ab2/efe2b54af7f9469aa426d34b531c393a/FLAGe9770b3c3 [2022-11-19 08:03:56,102 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:03:56,102 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/sv-benchmarks/c/pthread/indexer.i [2022-11-19 08:03:56,128 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/data/e28513ab2/efe2b54af7f9469aa426d34b531c393a/FLAGe9770b3c3 [2022-11-19 08:03:56,410 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/data/e28513ab2/efe2b54af7f9469aa426d34b531c393a [2022-11-19 08:03:56,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:03:56,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:03:56,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:03:56,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:03:56,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:03:56,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:56" (1/1) ... [2022-11-19 08:03:56,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e8d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:56, skipping insertion in model container [2022-11-19 08:03:56,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:56" (1/1) ... [2022-11-19 08:03:56,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:03:56,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:03:57,030 WARN L234 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_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/sv-benchmarks/c/pthread/indexer.i[47556,47569] [2022-11-19 08:03:57,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:03:57,116 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:03:57,164 WARN L234 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_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/sv-benchmarks/c/pthread/indexer.i[47556,47569] [2022-11-19 08:03:57,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:03:57,236 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:03:57,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57 WrapperNode [2022-11-19 08:03:57,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:03:57,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:03:57,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:03:57,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:03:57,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,333 INFO L138 Inliner]: procedures = 269, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2022-11-19 08:03:57,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:03:57,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:03:57,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:03:57,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:03:57,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:03:57,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:03:57,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:03:57,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:03:57,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (1/1) ... [2022-11-19 08:03:57,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:03:57,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:03:57,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:03:57,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:03:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:03:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:03:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:03:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread_routine [2022-11-19 08:03:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_routine [2022-11-19 08:03:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:03:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-19 08:03:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:03:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:03:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:03:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:03:57,495 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:03:57,638 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:03:57,642 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:03:57,981 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:03:57,988 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:03:57,989 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-19 08:03:57,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:57 BoogieIcfgContainer [2022-11-19 08:03:57,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:03:57,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:03:57,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:03:57,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:03:57,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:56" (1/3) ... [2022-11-19 08:03:57,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5b36ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:57, skipping insertion in model container [2022-11-19 08:03:57,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:57" (2/3) ... [2022-11-19 08:03:57,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5b36ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:57, skipping insertion in model container [2022-11-19 08:03:57,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:57" (3/3) ... [2022-11-19 08:03:58,001 INFO L112 eAbstractionObserver]: Analyzing ICFG indexer.i [2022-11-19 08:03:58,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 08:03:58,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:03:58,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-19 08:03:58,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:03:58,163 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-19 08:03:58,199 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:03:58,214 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 155 transitions, 318 flow [2022-11-19 08:03:58,218 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 155 transitions, 318 flow [2022-11-19 08:03:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 155 transitions, 318 flow [2022-11-19 08:03:58,330 INFO L130 PetriNetUnfolder]: 18/193 cut-off events. [2022-11-19 08:03:58,330 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-19 08:03:58,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 193 events. 18/193 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2022-11-19 08:03:58,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 6424 [2022-11-19 08:04:02,866 INFO L134 LiptonReduction]: Checked pairs total: 17659 [2022-11-19 08:04:02,866 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-19 08:04:02,879 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 54 transitions, 116 flow [2022-11-19 08:04:02,952 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:02,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:04:02,978 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;@53f90ce1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:04:02,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-19 08:04:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:04:02,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:02,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:02,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash 76447111, now seen corresponding path program 1 times [2022-11-19 08:04:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:03,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434062381] [2022-11-19 08:04:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:03,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:03,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434062381] [2022-11-19 08:04:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434062381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:03,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:03,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:04:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112436455] [2022-11-19 08:04:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:03,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:04:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:04:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:04:03,280 INFO L87 Difference]: Start difference. First operand has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:03,424 INFO L93 Difference]: Finished difference Result 477 states and 948 transitions. [2022-11-19 08:04:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:04:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-19 08:04:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:03,439 INFO L225 Difference]: With dead ends: 477 [2022-11-19 08:04:03,440 INFO L226 Difference]: Without dead ends: 476 [2022-11-19 08:04:03,441 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-11-19 08:04:03,444 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:03,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-19 08:04:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-19 08:04:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 459 states have (on average 2.0631808278867103) internal successors, (947), 475 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 947 transitions. [2022-11-19 08:04:03,506 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 947 transitions. Word has length 8 [2022-11-19 08:04:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:03,507 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 947 transitions. [2022-11-19 08:04:03,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 947 transitions. [2022-11-19 08:04:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:04:03,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:03,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:04:03,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2116720462, now seen corresponding path program 1 times [2022-11-19 08:04:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:03,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166981185] [2022-11-19 08:04:03,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:03,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:03,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166981185] [2022-11-19 08:04:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166981185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448274636] [2022-11-19 08:04:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:03,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:03,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:03,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:04:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:03,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:04:03,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:03,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:04:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:03,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448274636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:04:03,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [289172585] [2022-11-19 08:04:03,816 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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:336) 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-11-19 08:04:03,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:04:03,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-19 08:04:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247854782] [2022-11-19 08:04:03,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:04:03,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:04:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:04:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:04:03,844 INFO L87 Difference]: Start difference. First operand 476 states and 947 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:03,939 INFO L93 Difference]: Finished difference Result 279 states and 542 transitions. [2022-11-19 08:04:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:04:03,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-11-19 08:04:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:03,941 INFO L225 Difference]: With dead ends: 279 [2022-11-19 08:04:03,942 INFO L226 Difference]: Without dead ends: 279 [2022-11-19 08:04:03,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:04:03,943 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 105 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:03,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 38 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-19 08:04:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-19 08:04:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 270 states have (on average 2.0074074074074075) internal successors, (542), 278 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 542 transitions. [2022-11-19 08:04:03,957 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 542 transitions. Word has length 9 [2022-11-19 08:04:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:03,957 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 542 transitions. [2022-11-19 08:04:03,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 542 transitions. [2022-11-19 08:04:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:04:03,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:03,959 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:03,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:04:04,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:04,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1750452409, now seen corresponding path program 2 times [2022-11-19 08:04:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:04,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381111486] [2022-11-19 08:04:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:04,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:04,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381111486] [2022-11-19 08:04:04,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381111486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:04,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605091049] [2022-11-19 08:04:04,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:04:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:04,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:04,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:04:04,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:04:04,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:04:04,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 08:04:04,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:04,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:04:04,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:04:04,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 08:04:04,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:04:04,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:04:04,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:04:04,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-19 08:04:04,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:04:04,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:04:04,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:04:04,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:04:04,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-19 08:04:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 08:04:04,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:04:04,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605091049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:04,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:04:04,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2022-11-19 08:04:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209533258] [2022-11-19 08:04:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:04,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:04:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:04:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:04:04,705 INFO L87 Difference]: Start difference. First operand 279 states and 542 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-11-19 08:04:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:05,127 INFO L93 Difference]: Finished difference Result 364 states and 721 transitions. [2022-11-19 08:04:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:04:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 12 [2022-11-19 08:04:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:05,130 INFO L225 Difference]: With dead ends: 364 [2022-11-19 08:04:05,130 INFO L226 Difference]: Without dead ends: 364 [2022-11-19 08:04:05,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:04:05,132 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 96 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:05,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 17 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:04:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-19 08:04:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-11-19 08:04:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 356 states have (on average 2.0252808988764044) internal successors, (721), 363 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 721 transitions. [2022-11-19 08:04:05,149 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 721 transitions. Word has length 12 [2022-11-19 08:04:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:05,149 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 721 transitions. [2022-11-19 08:04:05,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-11-19 08:04:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 721 transitions. [2022-11-19 08:04:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:04:05,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:05,151 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:05,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:04:05,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:05,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread_routineErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1475924512, now seen corresponding path program 1 times [2022-11-19 08:04:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:05,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869899955] [2022-11-19 08:04:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:05,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:05,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869899955] [2022-11-19 08:04:05,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869899955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:05,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659801969] [2022-11-19 08:04:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:05,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:05,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:05,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:04:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:05,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:04:05,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:05,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:04:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:05,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659801969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:04:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [275008359] [2022-11-19 08:04:05,769 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:336) 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-11-19 08:04:05,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:04:05,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-19 08:04:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369096603] [2022-11-19 08:04:05,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:04:05,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 08:04:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:05,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 08:04:05,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:04:05,777 INFO L87 Difference]: Start difference. First operand 364 states and 721 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:05,843 INFO L93 Difference]: Finished difference Result 370 states and 727 transitions. [2022-11-19 08:04:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:04:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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-11-19 08:04:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:05,846 INFO L225 Difference]: With dead ends: 370 [2022-11-19 08:04:05,846 INFO L226 Difference]: Without dead ends: 370 [2022-11-19 08:04:05,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:04:05,849 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 103 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:05,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-19 08:04:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-11-19 08:04:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 362 states have (on average 2.0082872928176796) internal successors, (727), 369 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 727 transitions. [2022-11-19 08:04:05,871 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 727 transitions. Word has length 20 [2022-11-19 08:04:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:05,873 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 727 transitions. [2022-11-19 08:04:05,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 727 transitions. [2022-11-19 08:04:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:04:05,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:05,875 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:05,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-19 08:04:06,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:06,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread_routineErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash 927032512, now seen corresponding path program 2 times [2022-11-19 08:04:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:06,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789564936] [2022-11-19 08:04:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:04:06,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789564936] [2022-11-19 08:04:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789564936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176697916] [2022-11-19 08:04:06,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:04:06,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:06,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:06,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:04:06,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:04:06,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:04:06,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 08:04:06,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:06,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:04:06,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 08:04:06,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:04:06,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-19 08:04:06,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:04:06,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-19 08:04:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:04:06,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:04:06,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176697916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:06,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:04:06,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2022-11-19 08:04:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580984710] [2022-11-19 08:04:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:04:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:04:06,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:04:06,603 INFO L87 Difference]: Start difference. First operand 370 states and 727 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:06,804 INFO L93 Difference]: Finished difference Result 546 states and 1085 transitions. [2022-11-19 08:04:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:04:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-11-19 08:04:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:06,813 INFO L225 Difference]: With dead ends: 546 [2022-11-19 08:04:06,813 INFO L226 Difference]: Without dead ends: 546 [2022-11-19 08:04:06,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:04:06,815 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:06,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 20 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:04:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-19 08:04:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 398. [2022-11-19 08:04:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.9974358974358974) internal successors, (779), 397 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 779 transitions. [2022-11-19 08:04:06,832 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 779 transitions. Word has length 26 [2022-11-19 08:04:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:06,849 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 779 transitions. [2022-11-19 08:04:06,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 779 transitions. [2022-11-19 08:04:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:04:06,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:06,852 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:06,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-19 08:04:07,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:07,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1423704329, now seen corresponding path program 1 times [2022-11-19 08:04:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:07,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482625069] [2022-11-19 08:04:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:07,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:07,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482625069] [2022-11-19 08:04:07,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482625069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:07,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124698207] [2022-11-19 08:04:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:07,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:07,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:07,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:07,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:04:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:07,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:04:07,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:07,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:04:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:07,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124698207] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:04:07,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954974131] [2022-11-19 08:04:07,733 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:336) 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-11-19 08:04:07,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:04:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-11-19 08:04:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640573319] [2022-11-19 08:04:07,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:04:07,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 08:04:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 08:04:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 08:04:07,736 INFO L87 Difference]: Start difference. First operand 398 states and 779 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 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-11-19 08:04:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:07,834 INFO L93 Difference]: Finished difference Result 410 states and 791 transitions. [2022-11-19 08:04:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 08:04:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 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 29 [2022-11-19 08:04:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:07,837 INFO L225 Difference]: With dead ends: 410 [2022-11-19 08:04:07,837 INFO L226 Difference]: Without dead ends: 410 [2022-11-19 08:04:07,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-19 08:04:07,838 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 136 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:07,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 57 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-19 08:04:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-19 08:04:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 402 states have (on average 1.9676616915422886) internal successors, (791), 409 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 791 transitions. [2022-11-19 08:04:07,850 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 791 transitions. Word has length 29 [2022-11-19 08:04:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:07,851 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 791 transitions. [2022-11-19 08:04:07,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 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-11-19 08:04:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 791 transitions. [2022-11-19 08:04:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 08:04:07,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:07,852 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:07,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:04:08,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 08:04:08,053 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1972749367, now seen corresponding path program 2 times [2022-11-19 08:04:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188334352] [2022-11-19 08:04:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:08,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:08,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188334352] [2022-11-19 08:04:08,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188334352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932318665] [2022-11-19 08:04:08,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:04:08,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:08,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:08,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:08,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:04:14,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-11-19 08:04:14,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:04:14,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 08:04:14,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:14,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:04:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:15,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932318665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:04:15,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229287473] [2022-11-19 08:04:15,500 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:336) 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-11-19 08:04:15,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:04:15,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-11-19 08:04:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118830792] [2022-11-19 08:04:15,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:04:15,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-19 08:04:15,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:15,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-19 08:04:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 08:04:15,504 INFO L87 Difference]: Start difference. First operand 410 states and 791 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:15,685 INFO L93 Difference]: Finished difference Result 434 states and 815 transitions. [2022-11-19 08:04:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-19 08:04:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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 41 [2022-11-19 08:04:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:15,689 INFO L225 Difference]: With dead ends: 434 [2022-11-19 08:04:15,689 INFO L226 Difference]: Without dead ends: 434 [2022-11-19 08:04:15,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 08:04:15,691 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 375 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:15,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 38 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-19 08:04:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-11-19 08:04:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 426 states have (on average 1.9131455399061033) internal successors, (815), 433 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 815 transitions. [2022-11-19 08:04:15,707 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 815 transitions. Word has length 41 [2022-11-19 08:04:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:15,707 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 815 transitions. [2022-11-19 08:04:15,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 815 transitions. [2022-11-19 08:04:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 08:04:15,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:15,716 INFO L195 NwaCegarLoop]: trace histogram [46, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:15,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:04:15,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:15,917 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1844465993, now seen corresponding path program 3 times [2022-11-19 08:04:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:15,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881583414] [2022-11-19 08:04:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:17,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:17,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881583414] [2022-11-19 08:04:17,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881583414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:17,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532826201] [2022-11-19 08:04:17,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:04:17,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:17,829 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:17,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:04:18,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:04:18,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:04:18,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-19 08:04:18,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:18,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:04:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:21,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532826201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:04:21,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [554295112] [2022-11-19 08:04:21,216 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:336) 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-11-19 08:04:21,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:04:21,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2022-11-19 08:04:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480581389] [2022-11-19 08:04:21,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:04:21,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-19 08:04:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-19 08:04:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-19 08:04:21,225 INFO L87 Difference]: Start difference. First operand 434 states and 815 transitions. Second operand has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:21,478 INFO L93 Difference]: Finished difference Result 482 states and 863 transitions. [2022-11-19 08:04:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-19 08:04:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 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 65 [2022-11-19 08:04:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:21,481 INFO L225 Difference]: With dead ends: 482 [2022-11-19 08:04:21,481 INFO L226 Difference]: Without dead ends: 482 [2022-11-19 08:04:21,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-19 08:04:21,484 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 511 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:21,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 38 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-19 08:04:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-11-19 08:04:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 474 states have (on average 1.8206751054852321) internal successors, (863), 481 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 863 transitions. [2022-11-19 08:04:21,497 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 863 transitions. Word has length 65 [2022-11-19 08:04:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:21,497 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 863 transitions. [2022-11-19 08:04:21,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 863 transitions. [2022-11-19 08:04:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 08:04:21,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:21,500 INFO L195 NwaCegarLoop]: trace histogram [94, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:21,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:04:21,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:21,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:21,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1004731465, now seen corresponding path program 4 times [2022-11-19 08:04:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:21,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483798723] [2022-11-19 08:04:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:28,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483798723] [2022-11-19 08:04:28,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483798723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:04:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097094679] [2022-11-19 08:04:28,196 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:04:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:28,204 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:04:28,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:04:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:28,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 08:04:28,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:04:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:28,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:04:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:04:35,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097094679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:04:35,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1684646262] [2022-11-19 08:04:35,332 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:336) 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-11-19 08:04:35,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:04:35,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 130 [2022-11-19 08:04:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520808588] [2022-11-19 08:04:35,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:04:35,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-19 08:04:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-19 08:04:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2022-11-19 08:04:35,342 INFO L87 Difference]: Start difference. First operand 482 states and 863 transitions. Second operand has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:35,676 INFO L93 Difference]: Finished difference Result 516 states and 897 transitions. [2022-11-19 08:04:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-11-19 08:04:35,680 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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 113 [2022-11-19 08:04:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:35,683 INFO L225 Difference]: With dead ends: 516 [2022-11-19 08:04:35,683 INFO L226 Difference]: Without dead ends: 516 [2022-11-19 08:04:35,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 129 SyntacticMatches, 62 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2022-11-19 08:04:35,688 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 476 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:35,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 57 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:04:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-11-19 08:04:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2022-11-19 08:04:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.765748031496063) internal successors, (897), 515 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 897 transitions. [2022-11-19 08:04:35,701 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 897 transitions. Word has length 113 [2022-11-19 08:04:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:35,702 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 897 transitions. [2022-11-19 08:04:35,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 897 transitions. [2022-11-19 08:04:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-19 08:04:35,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:35,704 INFO L195 NwaCegarLoop]: trace histogram [128, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:35,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:04:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:04:35,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-19 08:04:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2031996567, now seen corresponding path program 5 times [2022-11-19 08:04:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913026625] [2022-11-19 08:04:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:04:36,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:04:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:04:36,480 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:04:36,480 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:04:36,481 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-11-19 08:04:36,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-11-19 08:04:36,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-11-19 08:04:36,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-11-19 08:04:36,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2022-11-19 08:04:36,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-11-19 08:04:36,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-11-19 08:04:36,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-11-19 08:04:36,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr2ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-11-19 08:04:36,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:04:36,488 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1] [2022-11-19 08:04:36,495 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:04:36,495 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:04:36,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:04:36 BasicIcfg [2022-11-19 08:04:36,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:04:36,631 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:04:36,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:04:36,632 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:04:36,632 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:57" (3/4) ... [2022-11-19 08:04:36,635 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:04:36,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:04:36,636 INFO L158 Benchmark]: Toolchain (without parser) took 40222.42ms. Allocated memory was 111.1MB in the beginning and 377.5MB in the end (delta: 266.3MB). Free memory was 80.8MB in the beginning and 240.7MB in the end (delta: -159.9MB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. [2022-11-19 08:04:36,640 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:04:36,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 822.30ms. Allocated memory is still 111.1MB. Free memory was 80.6MB in the beginning and 66.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-19 08:04:36,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.65ms. Allocated memory is still 111.1MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 08:04:36,640 INFO L158 Benchmark]: Boogie Preprocessor took 55.94ms. Allocated memory is still 111.1MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:04:36,641 INFO L158 Benchmark]: RCFGBuilder took 600.73ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 60.8MB in the beginning and 111.1MB in the end (delta: -50.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-19 08:04:36,641 INFO L158 Benchmark]: TraceAbstraction took 38637.44ms. Allocated memory was 136.3MB in the beginning and 377.5MB in the end (delta: 241.2MB). Free memory was 110.3MB in the beginning and 240.7MB in the end (delta: -130.4MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. [2022-11-19 08:04:36,641 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 377.5MB. Free memory is still 240.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:04:36,643 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.20ms. Allocated memory is still 111.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 822.30ms. Allocated memory is still 111.1MB. Free memory was 80.6MB in the beginning and 66.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.65ms. Allocated memory is still 111.1MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.94ms. Allocated memory is still 111.1MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 600.73ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 60.8MB in the beginning and 111.1MB in the end (delta: -50.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 38637.44ms. Allocated memory was 136.3MB in the beginning and 377.5MB in the end (delta: 241.2MB). Free memory was 110.3MB in the beginning and 240.7MB in the end (delta: -130.4MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 377.5MB. Free memory is still 240.7MB. 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: 4.6s, 144 PlacesBefore, 50 PlacesAfterwards, 155 TransitionsBefore, 54 TransitionsAfterwards, 6424 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 12 ConcurrentYvCompositions, 7 ChoiceCompositions, 115 TotalNumberOfCompositions, 17659 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5691, independent: 5225, independent conditional: 0, independent unconditional: 5225, dependent: 466, dependent conditional: 0, dependent unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3778, independent: 3652, independent conditional: 0, independent unconditional: 3652, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3778, independent: 3582, independent conditional: 0, independent unconditional: 3582, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 196, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 642, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 421, dependent conditional: 0, dependent unconditional: 421, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5691, independent: 1573, independent conditional: 0, independent unconditional: 1573, dependent: 340, dependent conditional: 0, dependent unconditional: 340, unknown: 3778, unknown conditional: 0, unknown unconditional: 3778] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 308, Positive conditional cache size: 0, Positive unconditional cache size: 308, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, 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: 1043]: Data race detected Data race detected The following path leads to a data race: [L1002] 0 pthread_t tids[13]; [L1001] 0 pthread_mutex_t cas_mutex[128]; [L1000] 0 int table[128]; [L1039] 0 int i, arg; [L1040] 0 i = 0 VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=1, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=2, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=3, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=4, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=5, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=6, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=7, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=8, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=9, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=10, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=11, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=12, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=13, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=14, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=15, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=16, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=17, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=18, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=19, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=20, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=21, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=22, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=23, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=24, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=25, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=26, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=27, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=28, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=29, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=30, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=31, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=32, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=33, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=34, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=35, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=36, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=37, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=38, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=39, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=40, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=41, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=42, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=43, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=44, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=45, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=46, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=47, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=48, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=49, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=50, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=51, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=52, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=53, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=54, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=55, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=56, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=57, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=58, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=59, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=60, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=61, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=62, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=63, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=64, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=65, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=66, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=67, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=68, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=69, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=70, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=71, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=72, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=73, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=74, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=75, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=76, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=77, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=78, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=79, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=80, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=81, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=82, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=83, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=84, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=85, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=86, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=87, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=88, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=89, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=90, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=91, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=92, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=93, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=94, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=95, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=96, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=97, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=98, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=99, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=100, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=101, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=102, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=103, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=104, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=105, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=106, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=107, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=108, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=109, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=110, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=111, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=112, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=113, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=114, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=115, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=116, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=117, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=118, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=119, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=120, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=121, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=122, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=123, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=124, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=125, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=126, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=127, table={5:0}, tids={3:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=128, table={5:0}, tids={3:0}] [L1040] COND FALSE 0 !(i < 128) [L1042] 0 i = 0 VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={5:0}, tids={3:0}] [L1042] COND TRUE 0 i < 13 [L1043] 0 arg=i VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={5:0}, tids={3:0}] [L1044] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), thread_routine, &arg) VAL [arg={6:0}, cas_mutex={4:0}, i=0, pthread_create(&tids[i], ((void *)0), thread_routine, &arg)=-1, table={5:0}, tids={3:0}] [L1016] 1 int tid; [L1017] 1 int m = 0, w, h; [L1018] EXPR 1 \read(*arg) VAL [\read(*arg)=0, arg={6:0}, arg={6:0}, cas_mutex={4:0}, m=0, table={5:0}, tids={3:0}] [L1042] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=1, table={5:0}, tids={3:0}] [L1042] COND TRUE 0 i < 13 [L1043] 0 arg=i VAL [arg={6:0}, arg=i=3074, cas_mutex={4:0}, i=1, table={5:0}, tids={3:0}] [L1018] 1 tid = *((int *)arg) VAL [\read(*arg)=0, arg={6:0}, arg={6:0}, cas_mutex={4:0}, m=0, table={5:0}, tids={3:0}] [L1043] 0 arg=i VAL [arg={6:0}, arg=i=3074, cas_mutex={4:0}, i=1, table={5:0}, tids={3:0}] Now there is a data race (on the heap) between C: tid = *((int *)arg) [1018] and C: arg=i [1043] - UnprovableResult [Line: 1018]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 38.3s, OverallIterations: 10, TraceHistogramMax: 128, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1899 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1899 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1174 IncrementalHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 163 mSDtfsCounter, 1174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 391 SyntacticMatches, 62 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4685 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=0, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 148 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 785 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 2213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2255 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 137/17797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 08:04:36,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f7edcb-7ff5-4ae0-b0e1-ea96ac4c1339/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE