./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_safe-11-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f 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_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/fib_safe-11-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0 --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 deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 --- 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-e04fb08 [2022-11-16 20:12:58,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:12:58,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:12:58,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:12:58,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:12:58,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:12:58,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:12:58,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:12:58,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:12:58,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:12:58,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:12:58,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:12:58,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:12:58,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:12:58,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:12:58,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:12:58,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:12:58,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:12:58,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:12:58,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:12:58,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:12:58,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:12:58,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:12:58,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:12:58,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:12:58,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:12:58,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:12:58,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:12:58,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:12:58,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:12:58,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:12:58,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:12:58,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:12:58,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:12:58,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:12:58,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:12:58,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:12:58,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:12:58,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:12:58,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:12:58,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:12:58,368 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-16 20:12:58,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:12:58,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:12:58,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:12:58,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:12:58,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:12:58,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:12:58,414 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:12:58,414 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:12:58,415 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:12:58,415 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:12:58,416 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:12:58,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:12:58,417 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:12:58,417 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:12:58,417 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:12:58,417 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:12:58,418 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:12:58,418 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:12:58,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:12:58,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:12:58,419 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 20:12:58,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:12:58,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:12:58,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:12:58,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:12:58,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:12:58,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:12:58,422 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 20:12:58,423 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:12:58,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:12:58,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:12:58,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:12:58,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:12:58,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:12:58,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:12:58,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:12:58,425 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:12:58,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:12:58,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:12:58,425 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:12:58,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:12:58,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:12:58,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:12:58,426 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_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/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_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0 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 -> deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 [2022-11-16 20:12:58,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:12:58,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:12:58,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:12:58,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:12:58,777 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:12:58,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread/fib_safe-11-racy.i [2022-11-16 20:12:58,875 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/data/661745c81/bfc4e2f24a7c4eddac351a69922546ac/FLAG62cfd182a [2022-11-16 20:12:59,357 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:12:59,358 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/sv-benchmarks/c/pthread/fib_safe-11-racy.i [2022-11-16 20:12:59,372 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/data/661745c81/bfc4e2f24a7c4eddac351a69922546ac/FLAG62cfd182a [2022-11-16 20:12:59,690 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/data/661745c81/bfc4e2f24a7c4eddac351a69922546ac [2022-11-16 20:12:59,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:12:59,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:12:59,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:12:59,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:12:59,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:12:59,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:12:59" (1/1) ... [2022-11-16 20:12:59,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222f4164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:12:59, skipping insertion in model container [2022-11-16 20:12:59,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:12:59" (1/1) ... [2022-11-16 20:12:59,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:12:59,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:13:00,189 WARN L229 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_9e6b4bef-9abf-4147-8915-c1b78b430552/sv-benchmarks/c/pthread/fib_safe-11-racy.i[30815,30828] [2022-11-16 20:13:00,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:13:00,203 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:13:00,241 WARN L229 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_9e6b4bef-9abf-4147-8915-c1b78b430552/sv-benchmarks/c/pthread/fib_safe-11-racy.i[30815,30828] [2022-11-16 20:13:00,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:13:00,277 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:13:00,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00 WrapperNode [2022-11-16 20:13:00,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:13:00,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:13:00,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:13:00,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:13:00,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,327 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-16 20:13:00,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:13:00,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:13:00,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:13:00,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:13:00,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,356 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:13:00,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:13:00,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:13:00,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:13:00,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (1/1) ... [2022-11-16 20:13:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:13:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:13:00,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:13:00,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:13:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-16 20:13:00,443 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-16 20:13:00,443 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:13:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:13:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:13:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:13:00,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:13:00,446 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:13:00,623 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:13:00,626 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:13:01,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:13:01,068 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:13:01,068 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 20:13:01,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:13:01 BoogieIcfgContainer [2022-11-16 20:13:01,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:13:01,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:13:01,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:13:01,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:13:01,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:12:59" (1/3) ... [2022-11-16 20:13:01,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682c6027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:13:01, skipping insertion in model container [2022-11-16 20:13:01,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:13:00" (2/3) ... [2022-11-16 20:13:01,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682c6027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:13:01, skipping insertion in model container [2022-11-16 20:13:01,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:13:01" (3/3) ... [2022-11-16 20:13:01,082 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-11-racy.i [2022-11-16 20:13:01,092 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 20:13:01,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:13:01,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-16 20:13:01,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:13:01,194 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 20:13:01,250 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:13:01,267 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 193 transitions, 396 flow [2022-11-16 20:13:01,271 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 193 transitions, 396 flow [2022-11-16 20:13:01,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-16 20:13:01,363 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-16 20:13:01,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 20:13:01,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 366 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-11-16 20:13:01,386 INFO L119 LiptonReduction]: Number of co-enabled transitions 13080 [2022-11-16 20:13:06,947 INFO L134 LiptonReduction]: Checked pairs total: 14283 [2022-11-16 20:13:06,947 INFO L136 LiptonReduction]: Total number of compositions: 218 [2022-11-16 20:13:06,957 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 50 transitions, 110 flow [2022-11-16 20:13:07,080 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 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-16 20:13:07,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:13:07,109 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;@7997e50a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:13:07,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-16 20:13:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 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-16 20:13:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 20:13:07,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:07,123 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 20:13:07,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:07,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 777, now seen corresponding path program 1 times [2022-11-16 20:13:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:07,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687185915] [2022-11-16 20:13:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:07,301 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-16 20:13:07,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:07,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687185915] [2022-11-16 20:13:07,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687185915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:13:07,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:13:07,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 20:13:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382888401] [2022-11-16 20:13:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:13:07,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 20:13:07,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 20:13:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 20:13:07,355 INFO L87 Difference]: Start difference. First operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-16 20:13:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:07,425 INFO L93 Difference]: Finished difference Result 87 states and 251 transitions. [2022-11-16 20:13:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 20:13:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-16 20:13:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:07,442 INFO L225 Difference]: With dead ends: 87 [2022-11-16 20:13:07,442 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 20:13:07,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 20:13:07,449 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:07,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:13:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 20:13:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-16 20:13:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 2.9420289855072466) internal successors, (203), 70 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-16 20:13:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 203 transitions. [2022-11-16 20:13:07,513 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 203 transitions. Word has length 1 [2022-11-16 20:13:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:07,513 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 203 transitions. [2022-11-16 20:13:07,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-16 20:13:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 203 transitions. [2022-11-16 20:13:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 20:13:07,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:07,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:07,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:13:07,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1123045942, now seen corresponding path program 1 times [2022-11-16 20:13:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:07,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951824573] [2022-11-16 20:13:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:07,768 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-16 20:13:07,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:07,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951824573] [2022-11-16 20:13:07,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951824573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:13:07,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:13:07,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:13:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741722495] [2022-11-16 20:13:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:13:07,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:13:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:07,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:13:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:13:07,772 INFO L87 Difference]: Start difference. First operand 71 states and 203 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:13:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:07,809 INFO L93 Difference]: Finished difference Result 80 states and 230 transitions. [2022-11-16 20:13:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:13:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 20:13:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:07,811 INFO L225 Difference]: With dead ends: 80 [2022-11-16 20:13:07,812 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 20:13:07,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:13:07,813 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:07,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:13:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 20:13:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 20:13:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 2.948717948717949) internal successors, (230), 79 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-16 20:13:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 230 transitions. [2022-11-16 20:13:07,824 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 230 transitions. Word has length 7 [2022-11-16 20:13:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:07,824 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 230 transitions. [2022-11-16 20:13:07,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:13:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 230 transitions. [2022-11-16 20:13:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 20:13:07,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:07,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:07,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:13:07,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -454653754, now seen corresponding path program 1 times [2022-11-16 20:13:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694079336] [2022-11-16 20:13:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:13:07,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694079336] [2022-11-16 20:13:07,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694079336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:13:07,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:13:07,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:13:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423159024] [2022-11-16 20:13:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:13:07,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:13:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:13:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:13:07,886 INFO L87 Difference]: Start difference. First operand 80 states and 230 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-16 20:13:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:07,934 INFO L93 Difference]: Finished difference Result 123 states and 355 transitions. [2022-11-16 20:13:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:13:07,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-16 20:13:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:07,937 INFO L225 Difference]: With dead ends: 123 [2022-11-16 20:13:07,937 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 20:13:07,938 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-16 20:13:07,939 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:07,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:13:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 20:13:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2022-11-16 20:13:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 2.950617283950617) internal successors, (239), 82 states have internal predecessors, (239), 0 states have call successors, (0), 0 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-16 20:13:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 239 transitions. [2022-11-16 20:13:07,950 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 239 transitions. Word has length 8 [2022-11-16 20:13:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:07,952 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 239 transitions. [2022-11-16 20:13:07,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-16 20:13:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 239 transitions. [2022-11-16 20:13:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 20:13:07,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:07,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:07,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:13:07,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash -814915347, now seen corresponding path program 1 times [2022-11-16 20:13:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:07,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322518576] [2022-11-16 20:13:07,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:08,026 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-16 20:13:08,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322518576] [2022-11-16 20:13:08,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322518576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:13:08,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777364729] [2022-11-16 20:13:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:08,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:08,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:13:08,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:13:08,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:13:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:08,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 20:13:08,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:13:08,246 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-16 20:13:08,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:13:08,264 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-16 20:13:08,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777364729] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:13:08,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [17924252] [2022-11-16 20:13:08,287 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-16 20:13:08,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:13:08,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-16 20:13:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292038741] [2022-11-16 20:13:08,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:13:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 20:13:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 20:13:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:13:08,292 INFO L87 Difference]: Start difference. First operand 83 states and 239 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-16 20:13:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:08,407 INFO L93 Difference]: Finished difference Result 110 states and 320 transitions. [2022-11-16 20:13:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:13:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 20:13:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:08,409 INFO L225 Difference]: With dead ends: 110 [2022-11-16 20:13:08,409 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 20:13:08,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:13:08,411 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:08,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:13:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 20:13:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-16 20:13:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 2.962962962962963) internal successors, (320), 109 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-16 20:13:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 320 transitions. [2022-11-16 20:13:08,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 320 transitions. Word has length 10 [2022-11-16 20:13:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:08,432 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 320 transitions. [2022-11-16 20:13:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-16 20:13:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 320 transitions. [2022-11-16 20:13:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:13:08,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:08,441 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:08,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:13:08,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:08,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1330887315, now seen corresponding path program 2 times [2022-11-16 20:13:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:08,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500462646] [2022-11-16 20:13:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:08,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:08,796 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-16 20:13:08,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:08,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500462646] [2022-11-16 20:13:08,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500462646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:13:08,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881059113] [2022-11-16 20:13:08,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:13:08,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:08,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:13:08,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:13:08,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:13:08,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 20:13:08,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:13:08,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 20:13:08,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:13:08,964 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-16 20:13:08,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:13:09,047 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-16 20:13:09,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881059113] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:13:09,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069662769] [2022-11-16 20:13:09,048 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-16 20:13:09,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:13:09,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-16 20:13:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312035788] [2022-11-16 20:13:09,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:13:09,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 20:13:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 20:13:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-16 20:13:09,058 INFO L87 Difference]: Start difference. First operand 110 states and 320 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-16 20:13:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:09,242 INFO L93 Difference]: Finished difference Result 164 states and 482 transitions. [2022-11-16 20:13:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 20:13:09,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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 13 [2022-11-16 20:13:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:09,249 INFO L225 Difference]: With dead ends: 164 [2022-11-16 20:13:09,249 INFO L226 Difference]: Without dead ends: 164 [2022-11-16 20:13:09,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-16 20:13:09,254 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 150 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:09,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 12 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:13:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-16 20:13:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-16 20:13:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.9753086419753085) internal successors, (482), 163 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-16 20:13:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 482 transitions. [2022-11-16 20:13:09,288 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 482 transitions. Word has length 13 [2022-11-16 20:13:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:09,289 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 482 transitions. [2022-11-16 20:13:09,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-16 20:13:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 482 transitions. [2022-11-16 20:13:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 20:13:09,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:09,293 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:09,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 20:13:09,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:09,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1053911699, now seen corresponding path program 3 times [2022-11-16 20:13:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:09,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733577104] [2022-11-16 20:13:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:09,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:09,756 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-16 20:13:09,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:09,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733577104] [2022-11-16 20:13:09,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733577104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:13:09,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660212231] [2022-11-16 20:13:09,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 20:13:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:13:09,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:13:09,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:13:09,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 20:13:09,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:13:09,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 20:13:09,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:13:09,937 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-16 20:13:09,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:13:10,203 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-16 20:13:10,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660212231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:13:10,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092653305] [2022-11-16 20:13:10,204 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-16 20:13:10,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:13:10,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-16 20:13:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318550242] [2022-11-16 20:13:10,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:13:10,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 20:13:10,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 20:13:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-16 20:13:10,206 INFO L87 Difference]: Start difference. First operand 164 states and 482 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-16 20:13:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:10,548 INFO L93 Difference]: Finished difference Result 272 states and 806 transitions. [2022-11-16 20:13:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 20:13:10,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 19 [2022-11-16 20:13:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:10,553 INFO L225 Difference]: With dead ends: 272 [2022-11-16 20:13:10,553 INFO L226 Difference]: Without dead ends: 272 [2022-11-16 20:13:10,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 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-16 20:13:10,556 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 399 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 9 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:13:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-16 20:13:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-16 20:13:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 2.9851851851851854) internal successors, (806), 271 states have internal predecessors, (806), 0 states have call successors, (0), 0 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-16 20:13:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 806 transitions. [2022-11-16 20:13:10,587 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 806 transitions. Word has length 19 [2022-11-16 20:13:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:10,587 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 806 transitions. [2022-11-16 20:13:10,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-16 20:13:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 806 transitions. [2022-11-16 20:13:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 20:13:10,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:10,591 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:10,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 20:13:10,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 20:13:10,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:10,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash 708785517, now seen corresponding path program 4 times [2022-11-16 20:13:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:10,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067663121] [2022-11-16 20:13:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:13:11,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:13:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067663121] [2022-11-16 20:13:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067663121] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:13:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211365228] [2022-11-16 20:13:11,380 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 20:13:11,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:13:11,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:13:11,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:13:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:13:11,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 20:13:11,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:13:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:13:11,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:13:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:13:11,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211365228] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:13:11,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [794199586] [2022-11-16 20:13:11,958 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-16 20:13:11,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:13:11,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2022-11-16 20:13:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197133900] [2022-11-16 20:13:11,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:13:11,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 20:13:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:13:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 20:13:11,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-16 20:13:11,961 INFO L87 Difference]: Start difference. First operand 272 states and 806 transitions. Second operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 20:13:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:13:12,284 INFO L93 Difference]: Finished difference Result 290 states and 860 transitions. [2022-11-16 20:13:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 20:13:12,285 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 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 31 [2022-11-16 20:13:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:13:12,287 INFO L225 Difference]: With dead ends: 290 [2022-11-16 20:13:12,288 INFO L226 Difference]: Without dead ends: 290 [2022-11-16 20:13:12,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 22 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-16 20:13:12,289 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 396 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:13:12,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 15 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:13:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-16 20:13:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-11-16 20:13:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 288 states have (on average 2.986111111111111) internal successors, (860), 289 states have internal predecessors, (860), 0 states have call successors, (0), 0 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-16 20:13:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 860 transitions. [2022-11-16 20:13:12,305 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 860 transitions. Word has length 31 [2022-11-16 20:13:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:13:12,306 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 860 transitions. [2022-11-16 20:13:12,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 20:13:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 860 transitions. [2022-11-16 20:13:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 20:13:12,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:13:12,309 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:13:12,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:13:12,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:13:12,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-16 20:13:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:13:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1735744147, now seen corresponding path program 5 times [2022-11-16 20:13:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:13:12,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858506208] [2022-11-16 20:13:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:13:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:13:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:13:12,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:13:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:13:12,731 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 20:13:12,731 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:13:12,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-16 20:13:12,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-16 20:13:12,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-16 20:13:12,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-16 20:13:12,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-16 20:13:12,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-16 20:13:12,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-16 20:13:12,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-16 20:13:12,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-16 20:13:12,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-16 20:13:12,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-16 20:13:12,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-16 20:13:12,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-16 20:13:12,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-16 20:13:12,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-16 20:13:12,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-16 20:13:12,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-16 20:13:12,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-16 20:13:12,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-16 20:13:12,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-16 20:13:12,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-16 20:13:12,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-16 20:13:12,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-16 20:13:12,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-16 20:13:12,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-16 20:13:12,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-16 20:13:12,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-16 20:13:12,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-16 20:13:12,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-16 20:13:12,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-16 20:13:12,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-16 20:13:12,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-16 20:13:12,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-16 20:13:12,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-16 20:13:12,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 20:13:12,745 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-11-16 20:13:12,753 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:13:12,753 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:13:12,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:13:12 BasicIcfg [2022-11-16 20:13:12,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:13:12,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:13:12,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:13:12,878 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:13:12,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:13:01" (3/4) ... [2022-11-16 20:13:12,882 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 20:13:12,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:13:12,884 INFO L158 Benchmark]: Toolchain (without parser) took 13189.02ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 66.4MB in the beginning and 101.3MB in the end (delta: -34.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-11-16 20:13:12,884 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 109.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:13:12,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.48ms. Allocated memory is still 109.1MB. Free memory was 66.1MB in the beginning and 74.3MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 20:13:12,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.66ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 72.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:13:12,885 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 70.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:13:12,886 INFO L158 Benchmark]: RCFGBuilder took 709.56ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 49.2MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-16 20:13:12,886 INFO L158 Benchmark]: TraceAbstraction took 11804.10ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 48.7MB in the beginning and 102.3MB in the end (delta: -53.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-11-16 20:13:12,887 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 192.9MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:13:12,889 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.32ms. Allocated memory is still 109.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.48ms. Allocated memory is still 109.1MB. Free memory was 66.1MB in the beginning and 74.3MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.66ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 72.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 70.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 709.56ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 49.2MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11804.10ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 48.7MB in the beginning and 102.3MB in the end (delta: -53.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 192.9MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 1.0MB). 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: 5.7s, 192 PlacesBefore, 53 PlacesAfterwards, 193 TransitionsBefore, 50 TransitionsAfterwards, 13080 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 165 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 218 TotalNumberOfCompositions, 14283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12363, independent: 12250, independent conditional: 0, independent unconditional: 12250, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8102, independent: 8044, independent conditional: 0, independent unconditional: 8044, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8102, independent: 7936, independent conditional: 0, independent unconditional: 7936, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 166, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 246, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12363, independent: 4206, independent conditional: 0, independent unconditional: 4206, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 8102, unknown conditional: 0, unknown unconditional: 8102] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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: 725]: Data race detected Data race detected The following path leads to a data race: [L703] 0 int cur = 1, prev = 0, next = 0; [L683] 0 int i, j; [L686] 0 int p, q; [L704] 0 int x; [L714] 0 pthread_t id1, id2; [L716] 0 i = 1 [L719] 0 j = 1 [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=75026, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2, q=0, x=0] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 24 [L706] COND TRUE 0 x < 24 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 24 [L706] COND FALSE 0 !(x < 24) [L711] 0 return prev; [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); [L725] 0 i <= correct VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, correct=46368, cur=75025, i=1, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] 1 p < 11 [L688] COND TRUE 1 p < 11 [L690] EXPR 1 i + j [L690] 1 i = i + j [L688] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=2, j=1, next=75025, p=1, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(argc)=75026, arg={0:0}, arg={0:0}, arg={0:0}, argc=75026, argv={75027:75028}, argv={75027:75028}, correct=46368, cur=75025, i=2, id1={5:0}, id2={3:0}, j=1, next=75025, p=1, prev=46368, q=0, x=24] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1035 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1035 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 21 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 104 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=0, InterpolantAutomatonStates: 76, 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, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 1/958 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-16 20:13:13,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e6b4bef-9abf-4147-8915-c1b78b430552/bin/utaipan-Xvt2sAort0/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