./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:23:13,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:23:13,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:23:13,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:23:13,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:23:13,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:23:13,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:23:13,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:23:13,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:23:13,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:23:13,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:23:13,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:23:13,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:23:13,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:23:13,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:23:13,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:23:13,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:23:13,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:23:13,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:23:13,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:23:13,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:23:13,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:23:13,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:23:13,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:23:13,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:23:13,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:23:13,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:23:13,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:23:13,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:23:13,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:23:13,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:23:13,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:23:13,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:23:13,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:23:13,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:23:13,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:23:13,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:23:13,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:23:13,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:23:13,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:23:13,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:23:13,646 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-19 08:23:13,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:23:13,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:23:13,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:23:13,679 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:23:13,680 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:23:13,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:23:13,686 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:23:13,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:23:13,686 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:23:13,687 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:23:13,687 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:23:13,687 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:23:13,687 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:23:13,687 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:23:13,688 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:23:13,688 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:23:13,688 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:23:13,688 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:23:13,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:23:13,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:23:13,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:23:13,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:23:13,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:23:13,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:23:13,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:23:13,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:23:13,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:23:13,691 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-19 08:23:13,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:23:13,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:23:13,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:23:13,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:23:13,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:23:13,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:23:13,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:23:13,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:23:13,693 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:23:13,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:23:13,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:23:13,693 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:23:13,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:23:13,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:23:13,694 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:23:13,694 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_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 [2022-11-19 08:23:13,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:23:13,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:23:13,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:23:13,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:23:14,000 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:23:14,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2022-11-19 08:23:14,080 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/data/31fb1784a/784eb769307c477c81c9cb6ba4cc6f21/FLAG48e884593 [2022-11-19 08:23:14,529 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:23:14,531 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2022-11-19 08:23:14,538 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/data/31fb1784a/784eb769307c477c81c9cb6ba4cc6f21/FLAG48e884593 [2022-11-19 08:23:14,894 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/data/31fb1784a/784eb769307c477c81c9cb6ba4cc6f21 [2022-11-19 08:23:14,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:23:14,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:23:14,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:23:14,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:23:14,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:23:14,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:23:14" (1/1) ... [2022-11-19 08:23:14,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1493dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:14, skipping insertion in model container [2022-11-19 08:23:14,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:23:14" (1/1) ... [2022-11-19 08:23:14,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:23:14,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:23:15,272 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c[2815,2828] [2022-11-19 08:23:15,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:23:15,290 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:23:15,333 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c[2815,2828] [2022-11-19 08:23:15,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:23:15,353 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:23:15,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15 WrapperNode [2022-11-19 08:23:15,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:23:15,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:23:15,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:23:15,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:23:15,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,427 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 371 [2022-11-19 08:23:15,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:23:15,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:23:15,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:23:15,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:23:15,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,476 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:23:15,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:23:15,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:23:15,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:23:15,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (1/1) ... [2022-11-19 08:23:15,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:23:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:23:15,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:23:15,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:23:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:23:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:23:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:23:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:23:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-19 08:23:15,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-19 08:23:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-19 08:23:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-19 08:23:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-19 08:23:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-19 08:23:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:23:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:23:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:23:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:23:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:23:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:23:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:23:15,571 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:23:15,710 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:23:15,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:23:16,550 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:23:16,822 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:23:16,822 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-19 08:23:16,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:23:16 BoogieIcfgContainer [2022-11-19 08:23:16,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:23:16,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:23:16,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:23:16,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:23:16,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:23:14" (1/3) ... [2022-11-19 08:23:16,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e83f7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:23:16, skipping insertion in model container [2022-11-19 08:23:16,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:23:15" (2/3) ... [2022-11-19 08:23:16,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e83f7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:23:16, skipping insertion in model container [2022-11-19 08:23:16,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:23:16" (3/3) ... [2022-11-19 08:23:16,837 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2022-11-19 08:23:16,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 08:23:16,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:23:16,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-11-19 08:23:16,856 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:23:16,967 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-19 08:23:17,007 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:23:17,021 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-19 08:23:17,024 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-19 08:23:17,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 528 transitions, 1080 flow [2022-11-19 08:23:17,310 INFO L130 PetriNetUnfolder]: 27/525 cut-off events. [2022-11-19 08:23:17,311 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-19 08:23:17,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 525 events. 27/525 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 624 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 421. Up to 3 conditions per place. [2022-11-19 08:23:17,329 INFO L119 LiptonReduction]: Number of co-enabled transitions 13362 [2022-11-19 08:25:52,918 INFO L134 LiptonReduction]: Checked pairs total: 94407 [2022-11-19 08:25:52,919 INFO L136 LiptonReduction]: Total number of compositions: 633 [2022-11-19 08:25:52,929 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 132 transitions, 288 flow [2022-11-19 08:25:55,875 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:25:55,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:25:55,900 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@393f6273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:25:55,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-11-19 08:25:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:25:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:25:56,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:56,035 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:25:56,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:25:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2022-11-19 08:25:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:25:56,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497892305] [2022-11-19 08:25:56,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:56,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:25:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:25:56,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:25:56,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497892305] [2022-11-19 08:25:56,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497892305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:56,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:56,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:25:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982198288] [2022-11-19 08:25:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:56,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:25:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:25:56,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:25:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:25:56,589 INFO L87 Difference]: Start difference. First operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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-19 08:25:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:57,240 INFO L93 Difference]: Finished difference Result 5616 states and 22643 transitions. [2022-11-19 08:25:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:25:57,244 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-19 08:25:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:57,432 INFO L225 Difference]: With dead ends: 5616 [2022-11-19 08:25:57,439 INFO L226 Difference]: Without dead ends: 5585 [2022-11-19 08:25:57,440 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-19 08:25:57,461 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:57,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:25:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-11-19 08:25:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 5585. [2022-11-19 08:25:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5573 states have (on average 4.047371254261619) internal successors, (22556), 5584 states have internal predecessors, (22556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:25:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 22556 transitions. [2022-11-19 08:25:58,059 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 22556 transitions. Word has length 1 [2022-11-19 08:25:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:58,060 INFO L495 AbstractCegarLoop]: Abstraction has 5585 states and 22556 transitions. [2022-11-19 08:25:58,060 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-19 08:25:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 22556 transitions. [2022-11-19 08:25:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:25:58,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:58,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:25:58,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:25:58,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:25:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -377013953, now seen corresponding path program 1 times [2022-11-19 08:25:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:25:58,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187003013] [2022-11-19 08:25:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:25:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:25:58,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:25:58,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187003013] [2022-11-19 08:25:58,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187003013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:25:58,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:25:58,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:25:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091331112] [2022-11-19 08:25:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:25:58,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:25:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:25:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:25:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:58,712 INFO L87 Difference]: Start difference. First operand 5585 states and 22556 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:25:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:25:59,157 INFO L93 Difference]: Finished difference Result 5586 states and 22557 transitions. [2022-11-19 08:25:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:25:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-19 08:25:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:25:59,207 INFO L225 Difference]: With dead ends: 5586 [2022-11-19 08:25:59,207 INFO L226 Difference]: Without dead ends: 5586 [2022-11-19 08:25:59,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:25:59,210 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:25:59,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:25:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-11-19 08:25:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5586. [2022-11-19 08:25:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5586 states, 5574 states have (on average 4.046824542518838) internal successors, (22557), 5585 states have internal predecessors, (22557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:25:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 22557 transitions. [2022-11-19 08:25:59,553 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 22557 transitions. Word has length 13 [2022-11-19 08:25:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:25:59,554 INFO L495 AbstractCegarLoop]: Abstraction has 5586 states and 22557 transitions. [2022-11-19 08:25:59,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:25:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 22557 transitions. [2022-11-19 08:25:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:25:59,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:25:59,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:25:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:25:59,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:25:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:25:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1964125668, now seen corresponding path program 1 times [2022-11-19 08:25:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:25:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553792592] [2022-11-19 08:25:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:25:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:00,289 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-19 08:26:00,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553792592] [2022-11-19 08:26:00,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553792592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:00,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:00,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:26:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108535189] [2022-11-19 08:26:00,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:00,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:26:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:26:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:00,292 INFO L87 Difference]: Start difference. First operand 5586 states and 22557 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:02,727 INFO L93 Difference]: Finished difference Result 9026 states and 36659 transitions. [2022-11-19 08:26:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:26:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-19 08:26:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:02,824 INFO L225 Difference]: With dead ends: 9026 [2022-11-19 08:26:02,824 INFO L226 Difference]: Without dead ends: 9026 [2022-11-19 08:26:02,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:02,831 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:02,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 71 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-19 08:26:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9026 states. [2022-11-19 08:26:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9026 to 6506. [2022-11-19 08:26:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6506 states, 6494 states have (on average 4.064213119802895) internal successors, (26393), 6505 states have internal predecessors, (26393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 26393 transitions. [2022-11-19 08:26:03,312 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 26393 transitions. Word has length 14 [2022-11-19 08:26:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:03,312 INFO L495 AbstractCegarLoop]: Abstraction has 6506 states and 26393 transitions. [2022-11-19 08:26:03,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 26393 transitions. [2022-11-19 08:26:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:26:03,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:03,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:03,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:26:03,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash 758369706, now seen corresponding path program 1 times [2022-11-19 08:26:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:03,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289499515] [2022-11-19 08:26:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:03,478 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-19 08:26:03,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289499515] [2022-11-19 08:26:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289499515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:03,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:03,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:26:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363636758] [2022-11-19 08:26:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:03,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:26:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:03,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:26:03,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:26:03,483 INFO L87 Difference]: Start difference. First operand 6506 states and 26393 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-19 08:26:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:04,165 INFO L93 Difference]: Finished difference Result 10116 states and 41047 transitions. [2022-11-19 08:26:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:26:04,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 15 [2022-11-19 08:26:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:04,245 INFO L225 Difference]: With dead ends: 10116 [2022-11-19 08:26:04,246 INFO L226 Difference]: Without dead ends: 10116 [2022-11-19 08:26:04,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:26:04,247 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:04,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 90 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:26:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-11-19 08:26:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 6336. [2022-11-19 08:26:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6326 states have (on average 4.064653809674359) internal successors, (25713), 6335 states have internal predecessors, (25713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 25713 transitions. [2022-11-19 08:26:04,605 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 25713 transitions. Word has length 15 [2022-11-19 08:26:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:04,606 INFO L495 AbstractCegarLoop]: Abstraction has 6336 states and 25713 transitions. [2022-11-19 08:26:04,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-19 08:26:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 25713 transitions. [2022-11-19 08:26:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:26:04,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:04,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:04,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:26:04,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2128932214, now seen corresponding path program 1 times [2022-11-19 08:26:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:04,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793304529] [2022-11-19 08:26:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:04,803 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-19 08:26:04,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:04,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793304529] [2022-11-19 08:26:04,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793304529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:04,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:04,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:26:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478904712] [2022-11-19 08:26:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:04,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:26:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:26:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:26:04,806 INFO L87 Difference]: Start difference. First operand 6336 states and 25713 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:05,142 INFO L93 Difference]: Finished difference Result 6338 states and 25715 transitions. [2022-11-19 08:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:26:05,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-19 08:26:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:05,183 INFO L225 Difference]: With dead ends: 6338 [2022-11-19 08:26:05,183 INFO L226 Difference]: Without dead ends: 6338 [2022-11-19 08:26:05,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:26:05,185 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:05,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:26:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-11-19 08:26:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6338. [2022-11-19 08:26:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6328 states have (on average 4.063685208596713) internal successors, (25715), 6337 states have internal predecessors, (25715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 25715 transitions. [2022-11-19 08:26:05,546 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 25715 transitions. Word has length 16 [2022-11-19 08:26:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:05,546 INFO L495 AbstractCegarLoop]: Abstraction has 6338 states and 25715 transitions. [2022-11-19 08:26:05,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 25715 transitions. [2022-11-19 08:26:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 08:26:05,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:05,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:05,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:26:05,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1703474724, now seen corresponding path program 1 times [2022-11-19 08:26:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:05,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528664676] [2022-11-19 08:26:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:26:06,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528664676] [2022-11-19 08:26:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528664676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:06,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:06,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:26:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912909950] [2022-11-19 08:26:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:26:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:06,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:26:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:06,335 INFO L87 Difference]: Start difference. First operand 6338 states and 25715 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:09,007 INFO L93 Difference]: Finished difference Result 9223 states and 37357 transitions. [2022-11-19 08:26:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:26:09,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-19 08:26:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:09,052 INFO L225 Difference]: With dead ends: 9223 [2022-11-19 08:26:09,052 INFO L226 Difference]: Without dead ends: 9223 [2022-11-19 08:26:09,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:09,053 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 104 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:09,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 100 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-19 08:26:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-11-19 08:26:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 8533. [2022-11-19 08:26:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8533 states, 8523 states have (on average 4.118737533732254) internal successors, (35104), 8532 states have internal predecessors, (35104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 35104 transitions. [2022-11-19 08:26:09,358 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 35104 transitions. Word has length 18 [2022-11-19 08:26:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:09,359 INFO L495 AbstractCegarLoop]: Abstraction has 8533 states and 35104 transitions. [2022-11-19 08:26:09,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 35104 transitions. [2022-11-19 08:26:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:26:09,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:09,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:09,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:26:09,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1767566649, now seen corresponding path program 1 times [2022-11-19 08:26:09,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:09,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326379830] [2022-11-19 08:26:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:26:09,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:09,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326379830] [2022-11-19 08:26:09,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326379830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:26:09,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442573028] [2022-11-19 08:26:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:09,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:09,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:26:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:10,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:26:10,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:26:10,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:26:10,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442573028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:10,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188683410] [2022-11-19 08:26:10,498 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:26:10,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:26:10,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-19 08:26:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859584069] [2022-11-19 08:26:10,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:26:10,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 08:26:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:10,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 08:26:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:26:10,507 INFO L87 Difference]: Start difference. First operand 8533 states and 35104 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 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-19 08:26:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:12,337 INFO L93 Difference]: Finished difference Result 9581 states and 38984 transitions. [2022-11-19 08:26:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:26:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 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 21 [2022-11-19 08:26:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:12,380 INFO L225 Difference]: With dead ends: 9581 [2022-11-19 08:26:12,380 INFO L226 Difference]: Without dead ends: 9581 [2022-11-19 08:26:12,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:26:12,382 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 124 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:12,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 313 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:26:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2022-11-19 08:26:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9216. [2022-11-19 08:26:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9206 states have (on average 4.111449054964154) internal successors, (37850), 9215 states have internal predecessors, (37850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 37850 transitions. [2022-11-19 08:26:12,713 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 37850 transitions. Word has length 21 [2022-11-19 08:26:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:12,714 INFO L495 AbstractCegarLoop]: Abstraction has 9216 states and 37850 transitions. [2022-11-19 08:26:12,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 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-19 08:26:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 37850 transitions. [2022-11-19 08:26:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:26:12,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:12,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:12,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:12,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:12,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1104842488, now seen corresponding path program 1 times [2022-11-19 08:26:12,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:12,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056776063] [2022-11-19 08:26:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:26:13,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:13,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056776063] [2022-11-19 08:26:13,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056776063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:26:13,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181876188] [2022-11-19 08:26:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:13,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:13,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:13,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:26:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:13,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:26:13,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:26:13,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:26:14,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181876188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:14,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051914359] [2022-11-19 08:26:14,086 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:26:14,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:26:14,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-19 08:26:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021104511] [2022-11-19 08:26:14,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:26:14,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 08:26:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 08:26:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:26:14,092 INFO L87 Difference]: Start difference. First operand 9216 states and 37850 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:15,369 INFO L93 Difference]: Finished difference Result 9281 states and 37616 transitions. [2022-11-19 08:26:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:26:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 21 [2022-11-19 08:26:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:15,410 INFO L225 Difference]: With dead ends: 9281 [2022-11-19 08:26:15,410 INFO L226 Difference]: Without dead ends: 9281 [2022-11-19 08:26:15,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:26:15,411 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 217 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:15,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 503 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-19 08:26:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2022-11-19 08:26:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9209. [2022-11-19 08:26:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9209 states, 9199 states have (on average 4.072725296227851) internal successors, (37465), 9208 states have internal predecessors, (37465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9209 states to 9209 states and 37465 transitions. [2022-11-19 08:26:15,890 INFO L78 Accepts]: Start accepts. Automaton has 9209 states and 37465 transitions. Word has length 21 [2022-11-19 08:26:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:15,890 INFO L495 AbstractCegarLoop]: Abstraction has 9209 states and 37465 transitions. [2022-11-19 08:26:15,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states and 37465 transitions. [2022-11-19 08:26:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:26:15,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:15,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:15,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:16,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:16,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash -76991994, now seen corresponding path program 2 times [2022-11-19 08:26:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:16,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647288408] [2022-11-19 08:26:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:26:17,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:17,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647288408] [2022-11-19 08:26:17,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647288408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:17,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:17,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:26:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701664492] [2022-11-19 08:26:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:17,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:26:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:17,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:26:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:26:17,873 INFO L87 Difference]: Start difference. First operand 9209 states and 37465 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 08:26:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:19,940 INFO L93 Difference]: Finished difference Result 23239 states and 94954 transitions. [2022-11-19 08:26:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:26:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 24 [2022-11-19 08:26:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:20,051 INFO L225 Difference]: With dead ends: 23239 [2022-11-19 08:26:20,051 INFO L226 Difference]: Without dead ends: 23239 [2022-11-19 08:26:20,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:26:20,052 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 534 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:20,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 93 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:26:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23239 states. [2022-11-19 08:26:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23239 to 12692. [2022-11-19 08:26:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12692 states, 12682 states have (on average 4.249724018293644) internal successors, (53895), 12691 states have internal predecessors, (53895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12692 states to 12692 states and 53895 transitions. [2022-11-19 08:26:20,725 INFO L78 Accepts]: Start accepts. Automaton has 12692 states and 53895 transitions. Word has length 24 [2022-11-19 08:26:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:20,726 INFO L495 AbstractCegarLoop]: Abstraction has 12692 states and 53895 transitions. [2022-11-19 08:26:20,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 08:26:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12692 states and 53895 transitions. [2022-11-19 08:26:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:26:20,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:20,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:20,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:26:20,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1499550153, now seen corresponding path program 2 times [2022-11-19 08:26:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605492151] [2022-11-19 08:26:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:26:22,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:22,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605492151] [2022-11-19 08:26:22,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605492151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 08:26:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654018952] [2022-11-19 08:26:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:22,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 08:26:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:22,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 08:26:22,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:26:22,425 INFO L87 Difference]: Start difference. First operand 12692 states and 53895 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-19 08:26:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:24,462 INFO L93 Difference]: Finished difference Result 11867 states and 50205 transitions. [2022-11-19 08:26:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:26:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 24 [2022-11-19 08:26:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:24,541 INFO L225 Difference]: With dead ends: 11867 [2022-11-19 08:26:24,541 INFO L226 Difference]: Without dead ends: 11867 [2022-11-19 08:26:24,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:26:24,543 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 290 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:24,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 66 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-19 08:26:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2022-11-19 08:26:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 8567. [2022-11-19 08:26:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8567 states, 8562 states have (on average 4.139803784162579) internal successors, (35445), 8566 states have internal predecessors, (35445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 35445 transitions. [2022-11-19 08:26:24,964 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 35445 transitions. Word has length 24 [2022-11-19 08:26:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:24,965 INFO L495 AbstractCegarLoop]: Abstraction has 8567 states and 35445 transitions. [2022-11-19 08:26:24,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-19 08:26:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 35445 transitions. [2022-11-19 08:26:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:26:24,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:24,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:24,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:26:24,974 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1765720546, now seen corresponding path program 3 times [2022-11-19 08:26:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:24,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696650603] [2022-11-19 08:26:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:26:27,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:27,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696650603] [2022-11-19 08:26:27,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696650603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:27,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:27,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:26:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711161833] [2022-11-19 08:26:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:27,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:26:27,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:26:27,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:26:27,455 INFO L87 Difference]: Start difference. First operand 8567 states and 35445 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 08:26:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:29,577 INFO L93 Difference]: Finished difference Result 20089 states and 82483 transitions. [2022-11-19 08:26:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:26:29,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 24 [2022-11-19 08:26:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:29,674 INFO L225 Difference]: With dead ends: 20089 [2022-11-19 08:26:29,675 INFO L226 Difference]: Without dead ends: 20089 [2022-11-19 08:26:29,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:26:29,676 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 389 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:29,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 108 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-19 08:26:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20089 states. [2022-11-19 08:26:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20089 to 8641. [2022-11-19 08:26:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8641 states, 8636 states have (on average 4.142890226956925) internal successors, (35778), 8640 states have internal predecessors, (35778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8641 states to 8641 states and 35778 transitions. [2022-11-19 08:26:30,138 INFO L78 Accepts]: Start accepts. Automaton has 8641 states and 35778 transitions. Word has length 24 [2022-11-19 08:26:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:30,139 INFO L495 AbstractCegarLoop]: Abstraction has 8641 states and 35778 transitions. [2022-11-19 08:26:30,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-19 08:26:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8641 states and 35778 transitions. [2022-11-19 08:26:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 08:26:30,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:30,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:30,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:26:30,148 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash 205356256, now seen corresponding path program 1 times [2022-11-19 08:26:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207077486] [2022-11-19 08:26:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:26:30,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:30,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207077486] [2022-11-19 08:26:30,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207077486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:30,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:30,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:26:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870787712] [2022-11-19 08:26:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:30,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:26:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:26:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:30,812 INFO L87 Difference]: Start difference. First operand 8641 states and 35778 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:32,337 INFO L93 Difference]: Finished difference Result 10006 states and 41357 transitions. [2022-11-19 08:26:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:26:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 25 [2022-11-19 08:26:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:32,398 INFO L225 Difference]: With dead ends: 10006 [2022-11-19 08:26:32,399 INFO L226 Difference]: Without dead ends: 10006 [2022-11-19 08:26:32,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:32,400 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:32,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 66 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-19 08:26:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2022-11-19 08:26:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 9451. [2022-11-19 08:26:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9451 states, 9446 states have (on average 4.143235231844167) internal successors, (39137), 9450 states have internal predecessors, (39137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9451 states to 9451 states and 39137 transitions. [2022-11-19 08:26:32,781 INFO L78 Accepts]: Start accepts. Automaton has 9451 states and 39137 transitions. Word has length 25 [2022-11-19 08:26:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:32,782 INFO L495 AbstractCegarLoop]: Abstraction has 9451 states and 39137 transitions. [2022-11-19 08:26:32,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 9451 states and 39137 transitions. [2022-11-19 08:26:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:26:32,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:32,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:32,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:26:32,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2073231951, now seen corresponding path program 4 times [2022-11-19 08:26:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:32,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466195478] [2022-11-19 08:26:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:26:33,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466195478] [2022-11-19 08:26:33,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466195478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:26:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536562427] [2022-11-19 08:26:33,307 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:26:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:33,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:33,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:26:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:33,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:26:33,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:26:34,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:26:34,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536562427] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:34,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1998053929] [2022-11-19 08:26:34,280 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:26:34,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:26:34,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-19 08:26:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189232757] [2022-11-19 08:26:34,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:26:34,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:26:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:26:34,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:26:34,285 INFO L87 Difference]: Start difference. First operand 9451 states and 39137 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:36,053 INFO L93 Difference]: Finished difference Result 22665 states and 91119 transitions. [2022-11-19 08:26:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:26:36,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 08:26:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:36,159 INFO L225 Difference]: With dead ends: 22665 [2022-11-19 08:26:36,159 INFO L226 Difference]: Without dead ends: 22665 [2022-11-19 08:26:36,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2022-11-19 08:26:36,160 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 767 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:36,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 668 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-19 08:26:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22665 states. [2022-11-19 08:26:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22665 to 17490. [2022-11-19 08:26:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17490 states, 17485 states have (on average 4.195767800972262) internal successors, (73363), 17489 states have internal predecessors, (73363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17490 states to 17490 states and 73363 transitions. [2022-11-19 08:26:36,898 INFO L78 Accepts]: Start accepts. Automaton has 17490 states and 73363 transitions. Word has length 26 [2022-11-19 08:26:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:36,899 INFO L495 AbstractCegarLoop]: Abstraction has 17490 states and 73363 transitions. [2022-11-19 08:26:36,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17490 states and 73363 transitions. [2022-11-19 08:26:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 08:26:36,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:36,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:36,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:26:37,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 08:26:37,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1109820915, now seen corresponding path program 1 times [2022-11-19 08:26:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:37,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636375361] [2022-11-19 08:26:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:37,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:26:37,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636375361] [2022-11-19 08:26:37,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636375361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:37,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:37,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:26:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376742306] [2022-11-19 08:26:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:37,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:26:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:37,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:26:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:37,639 INFO L87 Difference]: Start difference. First operand 17490 states and 73363 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:39,415 INFO L93 Difference]: Finished difference Result 17565 states and 73573 transitions. [2022-11-19 08:26:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:26:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 08:26:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:39,514 INFO L225 Difference]: With dead ends: 17565 [2022-11-19 08:26:39,514 INFO L226 Difference]: Without dead ends: 13954 [2022-11-19 08:26:39,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:39,516 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:39,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 81 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-19 08:26:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13954 states. [2022-11-19 08:26:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13954 to 13954. [2022-11-19 08:26:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13954 states, 13949 states have (on average 3.966305828374794) internal successors, (55326), 13953 states have internal predecessors, (55326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13954 states to 13954 states and 55326 transitions. [2022-11-19 08:26:40,233 INFO L78 Accepts]: Start accepts. Automaton has 13954 states and 55326 transitions. Word has length 28 [2022-11-19 08:26:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:40,233 INFO L495 AbstractCegarLoop]: Abstraction has 13954 states and 55326 transitions. [2022-11-19 08:26:40,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13954 states and 55326 transitions. [2022-11-19 08:26:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:26:40,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:40,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:40,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:26:40,239 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:26:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -968897296, now seen corresponding path program 5 times [2022-11-19 08:26:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825595855] [2022-11-19 08:26:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:26:43,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:43,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825595855] [2022-11-19 08:26:43,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825595855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:26:43,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585837352] [2022-11-19 08:26:43,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:26:43,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:43,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:43,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:43,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:26:44,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:26:44,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:44,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-19 08:26:44,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:44,493 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:26:44,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:26:44,569 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:26:44,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:26:44,657 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:26:44,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:26:44,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:26:45,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:26:45,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:26:45,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:26:45,385 INFO L321 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-19 08:26:45,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-19 08:26:45,427 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:26:45,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 88 [2022-11-19 08:26:49,697 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:26:49,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:26:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:26:51,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:26:51,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585837352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:51,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:26:51,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2022-11-19 08:26:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131142060] [2022-11-19 08:26:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:51,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:26:51,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:26:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2022-11-19 08:26:51,820 INFO L87 Difference]: Start difference. First operand 13954 states and 55326 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:02,020 INFO L93 Difference]: Finished difference Result 21839 states and 87108 transitions. [2022-11-19 08:27:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:27:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:27:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:02,112 INFO L225 Difference]: With dead ends: 21839 [2022-11-19 08:27:02,112 INFO L226 Difference]: Without dead ends: 21839 [2022-11-19 08:27:02,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=268, Invalid=785, Unknown=3, NotChecked=0, Total=1056 [2022-11-19 08:27:02,114 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 444 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:02,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 189 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 545 Invalid, 0 Unknown, 288 Unchecked, 1.6s Time] [2022-11-19 08:27:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21839 states. [2022-11-19 08:27:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21839 to 14102. [2022-11-19 08:27:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14102 states, 14097 states have (on average 3.9771582606228275) internal successors, (56066), 14101 states have internal predecessors, (56066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 56066 transitions. [2022-11-19 08:27:02,607 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 56066 transitions. Word has length 29 [2022-11-19 08:27:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:02,607 INFO L495 AbstractCegarLoop]: Abstraction has 14102 states and 56066 transitions. [2022-11-19 08:27:02,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 56066 transitions. [2022-11-19 08:27:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:27:02,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:02,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:02,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:02,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 08:27:02,815 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:27:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash -969476686, now seen corresponding path program 6 times [2022-11-19 08:27:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213730198] [2022-11-19 08:27:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:27:04,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:04,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213730198] [2022-11-19 08:27:04,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213730198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:04,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40334620] [2022-11-19 08:27:04,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:27:04,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:04,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:04,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:04,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:27:05,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:27:05,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:27:05,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-19 08:27:05,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:05,504 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:27:05,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:27:05,679 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:27:05,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:27:05,942 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:27:05,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:27:06,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:27:06,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:27:06,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:27:06,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:27:06,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:06,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 105 [2022-11-19 08:27:06,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2022-11-19 08:27:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:27:07,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:08,795 INFO L321 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-19 08:27:08,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 120 [2022-11-19 08:27:08,825 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-19 08:27:08,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 248 treesize of output 162 [2022-11-19 08:27:08,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2022-11-19 08:27:08,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2022-11-19 08:27:08,945 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:27:08,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2022-11-19 08:27:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:27:09,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40334620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:09,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1811214764] [2022-11-19 08:27:09,339 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:27:09,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:09,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 9] total 34 [2022-11-19 08:27:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525915925] [2022-11-19 08:27:09,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:27:09,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 08:27:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 08:27:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1023, Unknown=46, NotChecked=0, Total=1260 [2022-11-19 08:27:09,341 INFO L87 Difference]: Start difference. First operand 14102 states and 56066 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:16,679 INFO L93 Difference]: Finished difference Result 22041 states and 87700 transitions. [2022-11-19 08:27:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 08:27:16,679 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:27:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:16,766 INFO L225 Difference]: With dead ends: 22041 [2022-11-19 08:27:16,766 INFO L226 Difference]: Without dead ends: 21899 [2022-11-19 08:27:16,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=387, Invalid=2300, Unknown=69, NotChecked=0, Total=2756 [2022-11-19 08:27:16,768 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 398 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1284 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:16,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1059 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1159 Invalid, 0 Unknown, 1284 Unchecked, 3.7s Time] [2022-11-19 08:27:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2022-11-19 08:27:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 15018. [2022-11-19 08:27:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15018 states, 15013 states have (on average 4.00179844135083) internal successors, (60079), 15017 states have internal predecessors, (60079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15018 states to 15018 states and 60079 transitions. [2022-11-19 08:27:17,210 INFO L78 Accepts]: Start accepts. Automaton has 15018 states and 60079 transitions. Word has length 29 [2022-11-19 08:27:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:17,210 INFO L495 AbstractCegarLoop]: Abstraction has 15018 states and 60079 transitions. [2022-11-19 08:27:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15018 states and 60079 transitions. [2022-11-19 08:27:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:27:17,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:17,217 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:17,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:17,418 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:27:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -950907376, now seen corresponding path program 7 times [2022-11-19 08:27:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:17,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083469981] [2022-11-19 08:27:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:27:19,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083469981] [2022-11-19 08:27:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083469981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404313219] [2022-11-19 08:27:19,866 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:27:19,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:19,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:19,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:27:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:20,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-19 08:27:20,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:20,424 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:27:20,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:27:20,472 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:27:20,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:27:20,575 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:27:20,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:27:20,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:27:21,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:27:21,257 INFO L321 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-19 08:27:21,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 86 [2022-11-19 08:27:21,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-11-19 08:27:25,454 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-19 08:27:25,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-19 08:27:27,663 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:27:27,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:27:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:27:29,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:27:29,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404313219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:29,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:27:29,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-19 08:27:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932327121] [2022-11-19 08:27:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:29,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:27:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:29,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:27:29,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=496, Unknown=1, NotChecked=0, Total=600 [2022-11-19 08:27:29,782 INFO L87 Difference]: Start difference. First operand 15018 states and 60079 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:41,750 INFO L93 Difference]: Finished difference Result 23330 states and 93711 transitions. [2022-11-19 08:27:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:27:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:27:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:41,838 INFO L225 Difference]: With dead ends: 23330 [2022-11-19 08:27:41,838 INFO L226 Difference]: Without dead ends: 23324 [2022-11-19 08:27:41,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=301, Invalid=886, Unknown=3, NotChecked=0, Total=1190 [2022-11-19 08:27:41,839 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 490 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:41,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 219 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 468 Invalid, 0 Unknown, 657 Unchecked, 1.3s Time] [2022-11-19 08:27:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23324 states. [2022-11-19 08:27:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23324 to 15321. [2022-11-19 08:27:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15321 states, 15316 states have (on average 4.0037215983285455) internal successors, (61321), 15320 states have internal predecessors, (61321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15321 states to 15321 states and 61321 transitions. [2022-11-19 08:27:42,335 INFO L78 Accepts]: Start accepts. Automaton has 15321 states and 61321 transitions. Word has length 29 [2022-11-19 08:27:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:42,335 INFO L495 AbstractCegarLoop]: Abstraction has 15321 states and 61321 transitions. [2022-11-19 08:27:42,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15321 states and 61321 transitions. [2022-11-19 08:27:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:27:42,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:42,342 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:42,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-19 08:27:42,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 08:27:42,550 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:27:42,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash 516475509, now seen corresponding path program 1 times [2022-11-19 08:27:42,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:42,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589381334] [2022-11-19 08:27:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:42,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:27:44,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589381334] [2022-11-19 08:27:44,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589381334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251728213] [2022-11-19 08:27:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:44,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:44,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:27:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:44,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-19 08:27:44,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:45,042 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:27:45,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:27:45,083 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:27:45,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:27:45,153 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:27:45,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:27:45,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:27:45,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:27:45,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:27:45,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:27:45,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:27:45,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:27:46,203 INFO L321 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-19 08:27:46,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2022-11-19 08:27:46,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2022-11-19 08:27:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:27:50,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:27:50,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251728213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:50,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:27:50,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2022-11-19 08:27:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987928847] [2022-11-19 08:27:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:50,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:27:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:27:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=427, Unknown=1, NotChecked=0, Total=552 [2022-11-19 08:27:50,342 INFO L87 Difference]: Start difference. First operand 15321 states and 61321 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:58,637 INFO L93 Difference]: Finished difference Result 23167 states and 92840 transitions. [2022-11-19 08:27:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:27:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 30 [2022-11-19 08:27:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:58,716 INFO L225 Difference]: With dead ends: 23167 [2022-11-19 08:27:58,716 INFO L226 Difference]: Without dead ends: 22807 [2022-11-19 08:27:58,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=312, Invalid=807, Unknown=3, NotChecked=0, Total=1122 [2022-11-19 08:27:58,718 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 469 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:58,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 179 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 648 Invalid, 0 Unknown, 328 Unchecked, 1.7s Time] [2022-11-19 08:27:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22807 states. [2022-11-19 08:27:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22807 to 13066. [2022-11-19 08:27:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13066 states, 13061 states have (on average 3.930020672230304) internal successors, (51330), 13065 states have internal predecessors, (51330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13066 states to 13066 states and 51330 transitions. [2022-11-19 08:27:59,108 INFO L78 Accepts]: Start accepts. Automaton has 13066 states and 51330 transitions. Word has length 30 [2022-11-19 08:27:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:59,109 INFO L495 AbstractCegarLoop]: Abstraction has 13066 states and 51330 transitions. [2022-11-19 08:27:59,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13066 states and 51330 transitions. [2022-11-19 08:27:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:27:59,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:59,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:59,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-19 08:27:59,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 08:27:59,316 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:27:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash -433971327, now seen corresponding path program 1 times [2022-11-19 08:27:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:59,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234725493] [2022-11-19 08:27:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:28:00,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:00,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234725493] [2022-11-19 08:28:00,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234725493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:00,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:00,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:28:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497967995] [2022-11-19 08:28:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:00,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:28:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:28:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:28:00,668 INFO L87 Difference]: Start difference. First operand 13066 states and 51330 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:02,160 INFO L93 Difference]: Finished difference Result 24347 states and 95200 transitions. [2022-11-19 08:28:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:28:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-11-19 08:28:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:02,242 INFO L225 Difference]: With dead ends: 24347 [2022-11-19 08:28:02,242 INFO L226 Difference]: Without dead ends: 23459 [2022-11-19 08:28:02,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:28:02,243 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 420 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:02,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 90 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-19 08:28:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23459 states. [2022-11-19 08:28:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23459 to 18886. [2022-11-19 08:28:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18886 states, 18881 states have (on average 3.9447592818177) internal successors, (74481), 18885 states have internal predecessors, (74481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18886 states to 18886 states and 74481 transitions. [2022-11-19 08:28:02,684 INFO L78 Accepts]: Start accepts. Automaton has 18886 states and 74481 transitions. Word has length 30 [2022-11-19 08:28:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:02,684 INFO L495 AbstractCegarLoop]: Abstraction has 18886 states and 74481 transitions. [2022-11-19 08:28:02,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 18886 states and 74481 transitions. [2022-11-19 08:28:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:28:02,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:02,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:02,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 08:28:02,694 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:28:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1607907737, now seen corresponding path program 2 times [2022-11-19 08:28:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:02,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215827483] [2022-11-19 08:28:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:28:04,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:04,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215827483] [2022-11-19 08:28:04,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215827483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:04,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:04,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:28:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692890777] [2022-11-19 08:28:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:04,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:28:04,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:28:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:28:04,172 INFO L87 Difference]: Start difference. First operand 18886 states and 74481 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:05,725 INFO L93 Difference]: Finished difference Result 28205 states and 111726 transitions. [2022-11-19 08:28:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:28:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-11-19 08:28:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:05,804 INFO L225 Difference]: With dead ends: 28205 [2022-11-19 08:28:05,804 INFO L226 Difference]: Without dead ends: 27761 [2022-11-19 08:28:05,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:28:05,805 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 303 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:05,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 121 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-19 08:28:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27761 states. [2022-11-19 08:28:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27761 to 17554. [2022-11-19 08:28:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17554 states, 17549 states have (on average 3.9595418542367087) internal successors, (69486), 17553 states have internal predecessors, (69486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17554 states to 17554 states and 69486 transitions. [2022-11-19 08:28:06,426 INFO L78 Accepts]: Start accepts. Automaton has 17554 states and 69486 transitions. Word has length 30 [2022-11-19 08:28:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:06,426 INFO L495 AbstractCegarLoop]: Abstraction has 17554 states and 69486 transitions. [2022-11-19 08:28:06,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17554 states and 69486 transitions. [2022-11-19 08:28:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 08:28:06,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:06,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:06,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 08:28:06,437 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:28:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1486200180, now seen corresponding path program 1 times [2022-11-19 08:28:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:06,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016819143] [2022-11-19 08:28:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:28:06,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016819143] [2022-11-19 08:28:06,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016819143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603548431] [2022-11-19 08:28:06,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:06,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:06,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:06,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:06,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:28:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:07,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:28:07,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:28:07,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:28:07,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603548431] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:07,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 08:28:07,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-19 08:28:07,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29779094] [2022-11-19 08:28:07,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:07,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:28:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:07,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:28:07,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:28:07,440 INFO L87 Difference]: Start difference. First operand 17554 states and 69486 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:08,083 INFO L93 Difference]: Finished difference Result 17554 states and 69186 transitions. [2022-11-19 08:28:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:28:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 [2022-11-19 08:28:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:08,142 INFO L225 Difference]: With dead ends: 17554 [2022-11-19 08:28:08,142 INFO L226 Difference]: Without dead ends: 17554 [2022-11-19 08:28:08,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:28:08,143 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 180 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:08,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 40 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:28:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2022-11-19 08:28:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 17554. [2022-11-19 08:28:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17554 states, 17549 states have (on average 3.942446863069121) internal successors, (69186), 17553 states have internal predecessors, (69186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17554 states to 17554 states and 69186 transitions. [2022-11-19 08:28:08,715 INFO L78 Accepts]: Start accepts. Automaton has 17554 states and 69186 transitions. Word has length 34 [2022-11-19 08:28:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:08,716 INFO L495 AbstractCegarLoop]: Abstraction has 17554 states and 69186 transitions. [2022-11-19 08:28:08,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17554 states and 69186 transitions. [2022-11-19 08:28:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:28:08,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:08,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:08,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:08,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:08,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:28:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1836096789, now seen corresponding path program 3 times [2022-11-19 08:28:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:08,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680708029] [2022-11-19 08:28:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:28:11,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680708029] [2022-11-19 08:28:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680708029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183475778] [2022-11-19 08:28:11,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:28:11,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:11,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:11,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 08:28:11,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:28:11,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:28:11,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-19 08:28:11,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:11,784 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:28:11,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:28:11,938 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:28:11,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:28:12,147 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:28:12,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:28:12,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:28:12,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:28:12,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:28:13,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:28:13,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:13,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 37 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 130 [2022-11-19 08:28:13,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 103 [2022-11-19 08:28:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:28:13,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:13,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_5861 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5861) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_5861 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5861) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_5861 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5861) c_~B~0.base) (+ .cse1 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_5861 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5861) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-19 08:28:17,803 INFO L321 Elim1Store]: treesize reduction 3278, result has 4.5 percent of original size [2022-11-19 08:28:17,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 266 treesize of output 168 [2022-11-19 08:28:17,879 INFO L321 Elim1Store]: treesize reduction 732, result has 0.1 percent of original size [2022-11-19 08:28:17,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 183 treesize of output 70 [2022-11-19 08:28:17,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:28:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 1 not checked. [2022-11-19 08:28:18,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183475778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:18,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581099281] [2022-11-19 08:28:18,301 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:28:18,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:28:18,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 9] total 36 [2022-11-19 08:28:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300586055] [2022-11-19 08:28:18,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:28:18,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 08:28:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 08:28:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1031, Unknown=23, NotChecked=68, Total=1332 [2022-11-19 08:28:18,304 INFO L87 Difference]: Start difference. First operand 17554 states and 69186 transitions. Second operand has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 37 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:38,512 INFO L93 Difference]: Finished difference Result 26972 states and 107945 transitions. [2022-11-19 08:28:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-19 08:28:38,513 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 37 states have internal predecessors, (89), 0 states have call successors, (0), 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 35 [2022-11-19 08:28:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:38,605 INFO L225 Difference]: With dead ends: 26972 [2022-11-19 08:28:38,605 INFO L226 Difference]: Without dead ends: 26894 [2022-11-19 08:28:38,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=590, Invalid=2926, Unknown=28, NotChecked=116, Total=3660 [2022-11-19 08:28:38,606 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 607 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1713 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:38,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1047 Invalid, 3740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1993 Invalid, 0 Unknown, 1713 Unchecked, 5.6s Time] [2022-11-19 08:28:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26894 states. [2022-11-19 08:28:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26894 to 21042. [2022-11-19 08:28:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21042 states, 21037 states have (on average 3.969434805342967) internal successors, (83505), 21041 states have internal predecessors, (83505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21042 states to 21042 states and 83505 transitions. [2022-11-19 08:28:39,213 INFO L78 Accepts]: Start accepts. Automaton has 21042 states and 83505 transitions. Word has length 35 [2022-11-19 08:28:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:39,213 INFO L495 AbstractCegarLoop]: Abstraction has 21042 states and 83505 transitions. [2022-11-19 08:28:39,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 37 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 21042 states and 83505 transitions. [2022-11-19 08:28:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:28:39,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:39,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:39,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:39,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 08:28:39,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:28:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1835543439, now seen corresponding path program 4 times [2022-11-19 08:28:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:39,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201584064] [2022-11-19 08:28:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:28:41,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201584064] [2022-11-19 08:28:41,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201584064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492020210] [2022-11-19 08:28:41,814 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:28:41,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:41,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:41,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:41,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 08:28:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:42,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 08:28:42,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:42,492 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:28:42,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:28:42,603 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:28:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:28:42,724 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:28:42,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:28:43,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:28:43,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:28:43,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:28:43,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 30 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 140 [2022-11-19 08:28:43,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 118 [2022-11-19 08:28:43,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:43,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-19 08:28:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:28:44,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:44,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ 2 .cse1 c_~B~0.offset))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_6392 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6392) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_6392 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6392) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_6392 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6392) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)))))) is different from false [2022-11-19 08:28:46,444 INFO L321 Elim1Store]: treesize reduction 2652, result has 5.0 percent of original size [2022-11-19 08:28:46,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 234 treesize of output 155 [2022-11-19 08:28:46,499 INFO L321 Elim1Store]: treesize reduction 599, result has 0.2 percent of original size [2022-11-19 08:28:46,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 170 treesize of output 66 [2022-11-19 08:28:46,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:28:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:28:46,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492020210] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:46,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 08:28:46,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 13] total 31 [2022-11-19 08:28:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47152891] [2022-11-19 08:28:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:46,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:28:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:28:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=764, Unknown=13, NotChecked=58, Total=992 [2022-11-19 08:28:46,736 INFO L87 Difference]: Start difference. First operand 21042 states and 83505 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:49,165 INFO L93 Difference]: Finished difference Result 22477 states and 89200 transitions. [2022-11-19 08:28:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:28:49,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 35 [2022-11-19 08:28:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:49,237 INFO L225 Difference]: With dead ends: 22477 [2022-11-19 08:28:49,237 INFO L226 Difference]: Without dead ends: 22395 [2022-11-19 08:28:49,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=183, Invalid=994, Unknown=17, NotChecked=66, Total=1260 [2022-11-19 08:28:49,238 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 187 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:49,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 135 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 255 Invalid, 0 Unknown, 360 Unchecked, 1.1s Time] [2022-11-19 08:28:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22395 states. [2022-11-19 08:28:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22395 to 21096. [2022-11-19 08:28:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21096 states, 21091 states have (on average 3.9680906547816606) internal successors, (83691), 21095 states have internal predecessors, (83691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21096 states to 21096 states and 83691 transitions. [2022-11-19 08:28:49,765 INFO L78 Accepts]: Start accepts. Automaton has 21096 states and 83691 transitions. Word has length 35 [2022-11-19 08:28:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:49,765 INFO L495 AbstractCegarLoop]: Abstraction has 21096 states and 83691 transitions. [2022-11-19 08:28:49,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21096 states and 83691 transitions. [2022-11-19 08:28:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:28:49,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:49,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:49,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:49,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-19 08:28:49,981 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:28:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1818331929, now seen corresponding path program 5 times [2022-11-19 08:28:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:49,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042666445] [2022-11-19 08:28:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:28:52,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042666445] [2022-11-19 08:28:52,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042666445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369414855] [2022-11-19 08:28:52,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:28:52,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:52,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:52,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 08:28:52,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:28:52,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:28:52,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-19 08:28:52,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:53,049 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:28:53,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:28:53,096 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:28:53,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:28:53,198 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:28:53,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:28:53,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:28:53,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:28:53,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 127 [2022-11-19 08:28:53,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 90 [2022-11-19 08:28:53,641 INFO L321 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-19 08:28:53,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 77 [2022-11-19 08:29:03,821 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-19 08:29:03,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-19 08:29:07,988 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:29:07,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:29:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:29:08,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:29:08,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369414855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:29:08,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:29:08,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-19 08:29:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627124308] [2022-11-19 08:29:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:29:08,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 08:29:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:08,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 08:29:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=347, Unknown=5, NotChecked=0, Total=420 [2022-11-19 08:29:08,045 INFO L87 Difference]: Start difference. First operand 21096 states and 83691 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:17,075 INFO L93 Difference]: Finished difference Result 22843 states and 91163 transitions. [2022-11-19 08:29:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:29:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 35 [2022-11-19 08:29:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:17,144 INFO L225 Difference]: With dead ends: 22843 [2022-11-19 08:29:17,144 INFO L226 Difference]: Without dead ends: 22843 [2022-11-19 08:29:17,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=171, Invalid=578, Unknown=7, NotChecked=0, Total=756 [2022-11-19 08:29:17,145 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 269 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:17,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 70 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 180 Invalid, 0 Unknown, 141 Unchecked, 0.6s Time] [2022-11-19 08:29:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22843 states. [2022-11-19 08:29:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22843 to 21649. [2022-11-19 08:29:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21649 states, 21644 states have (on average 3.979209018665681) internal successors, (86126), 21648 states have internal predecessors, (86126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21649 states to 21649 states and 86126 transitions. [2022-11-19 08:29:17,717 INFO L78 Accepts]: Start accepts. Automaton has 21649 states and 86126 transitions. Word has length 35 [2022-11-19 08:29:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:17,718 INFO L495 AbstractCegarLoop]: Abstraction has 21649 states and 86126 transitions. [2022-11-19 08:29:17,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21649 states and 86126 transitions. [2022-11-19 08:29:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:29:17,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:17,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:17,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:17,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-19 08:29:17,933 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:29:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1193242331, now seen corresponding path program 6 times [2022-11-19 08:29:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:17,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207086785] [2022-11-19 08:29:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:29:20,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:20,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207086785] [2022-11-19 08:29:20,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207086785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:20,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816041977] [2022-11-19 08:29:20,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:29:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:20,488 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:20,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 08:29:21,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:29:21,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:29:21,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 08:29:21,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:21,245 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:29:21,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:29:21,358 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:29:21,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:29:21,481 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:29:21,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:29:22,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:29:22,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:29:22,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:29:22,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 137 [2022-11-19 08:29:22,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 468 treesize of output 190 [2022-11-19 08:29:22,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2022-11-19 08:29:22,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:22,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 28 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 104 [2022-11-19 08:29:22,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-11-19 08:29:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:29:24,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:24,949 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ .cse2 2 c_~B~0.offset) 0) (+ .cse2 3 c_~B~0.offset) 0))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_7484) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_7484) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_7484) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)) 0)))) is different from false [2022-11-19 08:29:25,064 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ 2 .cse2 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (let ((.cse1 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0)) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))) (and (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_7484) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_7484) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_7484) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0))))))) is different from false [2022-11-19 08:29:25,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ .cse4 c_~B~0.offset 1)) (.cse3 (+ 2 .cse4 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse3 0)))) (let ((.cse1 (let ((.cse5 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0)) c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ .cse5 2 c_~B~0.offset) 0) (+ .cse5 3 c_~B~0.offset) 0)))) (and (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_7484) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_7484) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_7471 (Array Int Int)) (v_ArrVal_7484 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_7471) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_7484) c_~B~0.base) (+ .cse4 c_~B~0.offset)) 0))))))) is different from false [2022-11-19 08:29:25,619 INFO L321 Elim1Store]: treesize reduction 878, result has 12.7 percent of original size [2022-11-19 08:29:25,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 201 [2022-11-19 08:29:25,651 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-19 08:29:25,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 136 [2022-11-19 08:29:25,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 73 [2022-11-19 08:29:25,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-19 08:29:25,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:25,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2022-11-19 08:29:25,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:25,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 176 treesize of output 323 [2022-11-19 08:29:26,059 INFO L321 Elim1Store]: treesize reduction 1005, result has 0.1 percent of original size [2022-11-19 08:29:26,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 173 treesize of output 1 [2022-11-19 08:29:26,141 INFO L321 Elim1Store]: treesize reduction 1005, result has 0.1 percent of original size [2022-11-19 08:29:26,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 1 [2022-11-19 08:29:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-11-19 08:29:26,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816041977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:26,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2133241269] [2022-11-19 08:29:26,317 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:29:26,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:26,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 32 [2022-11-19 08:29:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476949628] [2022-11-19 08:29:26,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:26,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 08:29:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 08:29:26,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=725, Unknown=4, NotChecked=174, Total=1056 [2022-11-19 08:29:26,319 INFO L87 Difference]: Start difference. First operand 21649 states and 86126 transitions. Second operand has 33 states, 32 states have (on average 2.6875) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:33,780 INFO L93 Difference]: Finished difference Result 25716 states and 102746 transitions. [2022-11-19 08:29:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 08:29:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.6875) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 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 35 [2022-11-19 08:29:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:33,880 INFO L225 Difference]: With dead ends: 25716 [2022-11-19 08:29:33,880 INFO L226 Difference]: Without dead ends: 25496 [2022-11-19 08:29:33,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=379, Invalid=1521, Unknown=4, NotChecked=258, Total=2162 [2022-11-19 08:29:33,881 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 471 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1041 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:33,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 656 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1808 Invalid, 0 Unknown, 1041 Unchecked, 4.5s Time] [2022-11-19 08:29:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25496 states. [2022-11-19 08:29:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25496 to 21568. [2022-11-19 08:29:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21568 states, 21563 states have (on average 3.9815424569865048) internal successors, (85854), 21567 states have internal predecessors, (85854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21568 states to 21568 states and 85854 transitions. [2022-11-19 08:29:34,519 INFO L78 Accepts]: Start accepts. Automaton has 21568 states and 85854 transitions. Word has length 35 [2022-11-19 08:29:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:34,519 INFO L495 AbstractCegarLoop]: Abstraction has 21568 states and 85854 transitions. [2022-11-19 08:29:34,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.6875) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 21568 states and 85854 transitions. [2022-11-19 08:29:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:29:34,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:34,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:34,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:34,739 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:29:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1028965504, now seen corresponding path program 1 times [2022-11-19 08:29:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:34,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796921703] [2022-11-19 08:29:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:29:36,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:36,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796921703] [2022-11-19 08:29:36,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796921703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:36,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575347041] [2022-11-19 08:29:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:36,546 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:36,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 08:29:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:37,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-19 08:29:37,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:37,273 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:29:37,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:29:37,314 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:29:37,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:29:37,391 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:29:37,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:29:37,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:29:37,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:29:38,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:38,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:29:38,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:38,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:29:38,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 147 [2022-11-19 08:29:38,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 110 [2022-11-19 08:29:38,437 INFO L321 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-19 08:29:38,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 107 [2022-11-19 08:29:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:29:42,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:29:42,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575347041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:29:42,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:29:42,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-19 08:29:42,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228780134] [2022-11-19 08:29:42,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:29:42,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:29:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:42,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:29:42,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=471, Unknown=1, NotChecked=0, Total=600 [2022-11-19 08:29:42,546 INFO L87 Difference]: Start difference. First operand 21568 states and 85854 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:51,101 INFO L93 Difference]: Finished difference Result 26757 states and 106895 transitions. [2022-11-19 08:29:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:29:51,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 36 [2022-11-19 08:29:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:51,201 INFO L225 Difference]: With dead ends: 26757 [2022-11-19 08:29:51,201 INFO L226 Difference]: Without dead ends: 26540 [2022-11-19 08:29:51,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=326, Invalid=861, Unknown=3, NotChecked=0, Total=1190 [2022-11-19 08:29:51,202 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 381 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:51,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 207 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 894 Invalid, 0 Unknown, 291 Unchecked, 2.0s Time] [2022-11-19 08:29:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26540 states. [2022-11-19 08:29:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26540 to 16148. [2022-11-19 08:29:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16148 states, 16143 states have (on average 3.9145140308492845) internal successors, (63192), 16147 states have internal predecessors, (63192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16148 states to 16148 states and 63192 transitions. [2022-11-19 08:29:51,811 INFO L78 Accepts]: Start accepts. Automaton has 16148 states and 63192 transitions. Word has length 36 [2022-11-19 08:29:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:51,812 INFO L495 AbstractCegarLoop]: Abstraction has 16148 states and 63192 transitions. [2022-11-19 08:29:51,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16148 states and 63192 transitions. [2022-11-19 08:29:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 08:29:51,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:51,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:51,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:52,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 08:29:52,022 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:29:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -917064783, now seen corresponding path program 1 times [2022-11-19 08:29:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:52,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417055742] [2022-11-19 08:29:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:29:52,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417055742] [2022-11-19 08:29:52,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417055742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:52,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067033250] [2022-11-19 08:29:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:52,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:52,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:52,277 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:52,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 08:29:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:52,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:29:52,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:29:53,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:29:53,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067033250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:53,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1355041097] [2022-11-19 08:29:53,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-19 08:29:53,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:53,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-19 08:29:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775695031] [2022-11-19 08:29:53,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:29:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:29:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:29:53,290 INFO L87 Difference]: Start difference. First operand 16148 states and 63192 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:55,131 INFO L93 Difference]: Finished difference Result 11909 states and 46568 transitions. [2022-11-19 08:29:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:29:55,131 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 37 [2022-11-19 08:29:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:55,161 INFO L225 Difference]: With dead ends: 11909 [2022-11-19 08:29:55,162 INFO L226 Difference]: Without dead ends: 11909 [2022-11-19 08:29:55,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-19 08:29:55,162 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 412 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:55,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 404 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-19 08:29:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11909 states. [2022-11-19 08:29:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11909 to 11884. [2022-11-19 08:29:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 11879 states have (on average 3.9159861941240846) internal successors, (46518), 11883 states have internal predecessors, (46518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 46518 transitions. [2022-11-19 08:29:55,530 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 46518 transitions. Word has length 37 [2022-11-19 08:29:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:55,531 INFO L495 AbstractCegarLoop]: Abstraction has 11884 states and 46518 transitions. [2022-11-19 08:29:55,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 46518 transitions. [2022-11-19 08:29:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:29:55,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:55,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:55,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:55,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-19 08:29:55,743 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:29:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1583393392, now seen corresponding path program 2 times [2022-11-19 08:29:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:55,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666401286] [2022-11-19 08:29:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:29:57,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:57,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666401286] [2022-11-19 08:29:57,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666401286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:57,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061638223] [2022-11-19 08:29:57,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:29:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:57,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:57,549 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:57,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 08:29:58,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:29:58,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:29:58,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-19 08:29:58,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:58,262 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:29:58,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:29:58,305 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:29:58,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:29:58,384 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:29:58,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:29:58,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:29:58,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:29:58,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:58,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:29:58,926 INFO L321 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-19 08:29:58,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-19 08:29:58,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2022-11-19 08:30:07,137 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:30:07,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:30:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:30:07,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:30:08,429 INFO L321 Elim1Store]: treesize reduction 557, result has 13.9 percent of original size [2022-11-19 08:30:08,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 108 [2022-11-19 08:30:08,450 INFO L321 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2022-11-19 08:30:08,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 161 treesize of output 91 [2022-11-19 08:30:08,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2022-11-19 08:30:08,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-11-19 08:30:08,517 INFO L321 Elim1Store]: treesize reduction 646, result has 0.2 percent of original size [2022-11-19 08:30:08,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 1 [2022-11-19 08:30:08,552 INFO L321 Elim1Store]: treesize reduction 646, result has 0.2 percent of original size [2022-11-19 08:30:08,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 1 [2022-11-19 08:30:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:30:08,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061638223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:30:08,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [327460926] [2022-11-19 08:30:08,890 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:30:08,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:30:08,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2022-11-19 08:30:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224242714] [2022-11-19 08:30:08,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:30:08,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 08:30:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:30:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 08:30:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=529, Unknown=21, NotChecked=0, Total=650 [2022-11-19 08:30:08,893 INFO L87 Difference]: Start difference. First operand 11884 states and 46518 transitions. Second operand has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:01,959 INFO L93 Difference]: Finished difference Result 28464 states and 111581 transitions. [2022-11-19 08:31:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-19 08:31:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 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 40 [2022-11-19 08:31:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:02,034 INFO L225 Difference]: With dead ends: 28464 [2022-11-19 08:31:02,034 INFO L226 Difference]: Without dead ends: 28462 [2022-11-19 08:31:02,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 94 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 58.5s TimeCoverageRelationStatistics Valid=1208, Invalid=3725, Unknown=37, NotChecked=0, Total=4970 [2022-11-19 08:31:02,035 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1055 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 988 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:02,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 618 Invalid, 2210 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [73 Valid, 1149 Invalid, 0 Unknown, 988 Unchecked, 3.8s Time] [2022-11-19 08:31:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28462 states. [2022-11-19 08:31:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28462 to 14450. [2022-11-19 08:31:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14450 states, 14445 states have (on average 3.934717895465559) internal successors, (56837), 14449 states have internal predecessors, (56837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14450 states to 14450 states and 56837 transitions. [2022-11-19 08:31:02,392 INFO L78 Accepts]: Start accepts. Automaton has 14450 states and 56837 transitions. Word has length 40 [2022-11-19 08:31:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:02,392 INFO L495 AbstractCegarLoop]: Abstraction has 14450 states and 56837 transitions. [2022-11-19 08:31:02,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14450 states and 56837 transitions. [2022-11-19 08:31:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:31:02,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:02,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:02,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-19 08:31:02,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-19 08:31:02,607 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:31:02,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1582814002, now seen corresponding path program 3 times [2022-11-19 08:31:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:02,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278351852] [2022-11-19 08:31:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:02,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:31:04,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:04,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278351852] [2022-11-19 08:31:04,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278351852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:04,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880319046] [2022-11-19 08:31:04,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:31:04,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:04,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:04,076 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:04,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 08:31:04,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:31:04,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:31:04,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-19 08:31:04,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:04,959 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:31:04,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:31:05,091 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:31:05,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:31:05,308 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:31:05,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:31:05,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:31:06,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:31:06,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:31:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:31:06,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:06,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 105 [2022-11-19 08:31:06,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2022-11-19 08:31:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:31:06,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:07,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse1)) (.cse3 (+ c_~A~0.offset .cse1 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse3 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (and (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) .cse3) 0)))))) is different from false [2022-11-19 08:31:07,444 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse4 1)) (.cse1 (+ c_~A~0.offset 2 .cse4)) (.cse3 (+ c_~A~0.offset .cse4 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse5 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0) .cse3 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))))) (and (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) .cse3) 0)) (forall ((v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9373 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_9373) c_~C~0.base v_ArrVal_9370) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)))))) is different from false [2022-11-19 08:31:07,602 INFO L321 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-19 08:31:07,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 121 [2022-11-19 08:31:07,627 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-19 08:31:07,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 95 [2022-11-19 08:31:07,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-19 08:31:07,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-19 08:31:07,691 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:31:07,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2022-11-19 08:31:07,726 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:31:07,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2022-11-19 08:31:07,760 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:31:07,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 1 [2022-11-19 08:31:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 21 trivial. 2 not checked. [2022-11-19 08:31:08,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880319046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [395726664] [2022-11-19 08:31:08,142 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:31:08,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:08,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 9] total 34 [2022-11-19 08:31:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061873819] [2022-11-19 08:31:08,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:31:08,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 08:31:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:08,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 08:31:08,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=939, Unknown=16, NotChecked=130, Total=1260 [2022-11-19 08:31:08,144 INFO L87 Difference]: Start difference. First operand 14450 states and 56837 transitions. Second operand has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:18,484 INFO L93 Difference]: Finished difference Result 36181 states and 143754 transitions. [2022-11-19 08:31:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-19 08:31:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 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 40 [2022-11-19 08:31:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:18,604 INFO L225 Difference]: With dead ends: 36181 [2022-11-19 08:31:18,605 INFO L226 Difference]: Without dead ends: 36107 [2022-11-19 08:31:18,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=481, Invalid=2463, Unknown=34, NotChecked=214, Total=3192 [2022-11-19 08:31:18,606 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 866 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1661 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:18,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 816 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2090 Invalid, 0 Unknown, 1661 Unchecked, 6.4s Time] [2022-11-19 08:31:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36107 states. [2022-11-19 08:31:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36107 to 23281. [2022-11-19 08:31:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23281 states, 23276 states have (on average 4.052242653376869) internal successors, (94320), 23280 states have internal predecessors, (94320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23281 states to 23281 states and 94320 transitions. [2022-11-19 08:31:19,451 INFO L78 Accepts]: Start accepts. Automaton has 23281 states and 94320 transitions. Word has length 40 [2022-11-19 08:31:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:19,452 INFO L495 AbstractCegarLoop]: Abstraction has 23281 states and 94320 transitions. [2022-11-19 08:31:19,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:31:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23281 states and 94320 transitions. [2022-11-19 08:31:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:31:19,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:19,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:19,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 08:31:19,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-19 08:31:19,672 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:31:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1601383312, now seen corresponding path program 4 times [2022-11-19 08:31:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:19,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713132107] [2022-11-19 08:31:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:31:21,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713132107] [2022-11-19 08:31:21,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713132107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079314143] [2022-11-19 08:31:21,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:31:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:21,483 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:21,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 08:31:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:22,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-19 08:31:22,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:22,281 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:31:22,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:31:22,325 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:31:22,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:31:22,416 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:31:22,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:31:22,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:31:23,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:31:23,202 INFO L321 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-19 08:31:23,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 86 [2022-11-19 08:31:23,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-11-19 08:31:27,404 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-19 08:31:27,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-19 08:31:29,619 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:31:29,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:31:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:31:31,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:32,489 INFO L321 Elim1Store]: treesize reduction 372, result has 17.1 percent of original size [2022-11-19 08:31:32,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 94 [2022-11-19 08:31:32,509 INFO L321 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-11-19 08:31:32,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 222 treesize of output 154 [2022-11-19 08:31:32,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2022-11-19 08:31:32,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 78 [2022-11-19 08:31:32,582 INFO L321 Elim1Store]: treesize reduction 448, result has 0.2 percent of original size [2022-11-19 08:31:32,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 1 [2022-11-19 08:31:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:31:33,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079314143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:33,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [994056806] [2022-11-19 08:31:33,029 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:31:33,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:33,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 27 [2022-11-19 08:31:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772484193] [2022-11-19 08:31:33,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:31:33,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:31:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:33,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:31:33,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=679, Unknown=13, NotChecked=0, Total=812 [2022-11-19 08:31:33,031 INFO L87 Difference]: Start difference. First operand 23281 states and 94320 transitions. Second operand has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:19,424 INFO L93 Difference]: Finished difference Result 66368 states and 272717 transitions. [2022-11-19 08:32:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-19 08:32:19,424 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 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 40 [2022-11-19 08:32:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:19,691 INFO L225 Difference]: With dead ends: 66368 [2022-11-19 08:32:19,691 INFO L226 Difference]: Without dead ends: 66225 [2022-11-19 08:32:19,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 79 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=754, Invalid=3246, Unknown=32, NotChecked=0, Total=4032 [2022-11-19 08:32:19,693 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1218 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 6919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4084 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:19,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 977 Invalid, 6919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2592 Invalid, 0 Unknown, 4084 Unchecked, 7.3s Time] [2022-11-19 08:32:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66225 states. [2022-11-19 08:32:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66225 to 34044. [2022-11-19 08:32:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34044 states, 34039 states have (on average 4.082258585739886) internal successors, (138956), 34043 states have internal predecessors, (138956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34044 states to 34044 states and 138956 transitions. [2022-11-19 08:32:21,255 INFO L78 Accepts]: Start accepts. Automaton has 34044 states and 138956 transitions. Word has length 40 [2022-11-19 08:32:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:21,255 INFO L495 AbstractCegarLoop]: Abstraction has 34044 states and 138956 transitions. [2022-11-19 08:32:21,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34044 states and 138956 transitions. [2022-11-19 08:32:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:32:21,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:21,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:21,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 08:32:21,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:21,490 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:32:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2015676936, now seen corresponding path program 5 times [2022-11-19 08:32:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:21,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467561066] [2022-11-19 08:32:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:32:23,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467561066] [2022-11-19 08:32:23,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467561066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147563932] [2022-11-19 08:32:23,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:32:23,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:23,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:23,480 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:23,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 08:32:24,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:32:24,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:32:24,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 08:32:24,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:24,252 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:32:24,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:32:24,292 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:32:24,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:32:24,376 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:32:24,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:32:24,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:32:24,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:32:24,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:24,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:32:24,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:24,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:32:25,082 INFO L321 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-19 08:32:25,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2022-11-19 08:32:25,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2022-11-19 08:32:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:32:25,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:32:27,571 INFO L321 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-19 08:32:27,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 121 [2022-11-19 08:32:27,595 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-19 08:32:27,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 95 [2022-11-19 08:32:27,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-19 08:32:27,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-19 08:32:27,690 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:32:27,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2022-11-19 08:32:27,739 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:32:27,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2022-11-19 08:32:27,834 INFO L321 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-19 08:32:27,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 1 [2022-11-19 08:32:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 1 refuted. 2 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:32:28,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147563932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:32:28,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085337395] [2022-11-19 08:32:28,205 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:32:28,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:32:28,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-11-19 08:32:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72618991] [2022-11-19 08:32:28,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:32:28,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-19 08:32:28,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:28,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-19 08:32:28,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=546, Unknown=36, NotChecked=0, Total=702 [2022-11-19 08:32:28,209 INFO L87 Difference]: Start difference. First operand 34044 states and 138956 transitions. Second operand has 27 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:35,224 INFO L93 Difference]: Finished difference Result 47810 states and 197299 transitions. [2022-11-19 08:32:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:32:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 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 40 [2022-11-19 08:32:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:35,399 INFO L225 Difference]: With dead ends: 47810 [2022-11-19 08:32:35,399 INFO L226 Difference]: Without dead ends: 47588 [2022-11-19 08:32:35,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=474, Invalid=1382, Unknown=36, NotChecked=0, Total=1892 [2022-11-19 08:32:35,400 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 752 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:35,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 458 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1739 Invalid, 0 Unknown, 228 Unchecked, 5.8s Time] [2022-11-19 08:32:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47588 states. [2022-11-19 08:32:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47588 to 36648. [2022-11-19 08:32:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36648 states, 36644 states have (on average 4.11161445257068) internal successors, (150666), 36647 states have internal predecessors, (150666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36648 states to 36648 states and 150666 transitions. [2022-11-19 08:32:37,204 INFO L78 Accepts]: Start accepts. Automaton has 36648 states and 150666 transitions. Word has length 40 [2022-11-19 08:32:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:37,205 INFO L495 AbstractCegarLoop]: Abstraction has 36648 states and 150666 transitions. [2022-11-19 08:32:37,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 36648 states and 150666 transitions. [2022-11-19 08:32:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:32:37,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:37,249 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:37,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-19 08:32:37,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:37,457 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:32:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1918841624, now seen corresponding path program 6 times [2022-11-19 08:32:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:37,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350625260] [2022-11-19 08:32:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:32:39,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350625260] [2022-11-19 08:32:39,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350625260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624965581] [2022-11-19 08:32:39,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:32:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:39,863 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:39,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-19 08:32:40,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:32:40,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:32:40,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-19 08:32:40,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:40,811 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:32:40,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-19 08:32:40,913 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:32:40,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:32:41,007 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:32:41,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:32:41,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 08:32:41,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:32:41,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:32:41,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 23 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 90 [2022-11-19 08:32:41,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2022-11-19 08:32:41,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:41,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:42,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:42,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 105 [2022-11-19 08:32:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:32:42,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:32:42,197 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0)))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_10767 (Array Int Int)) (v_ArrVal_10771 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_10767) c_~C~0.base v_ArrVal_10771) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_10767 (Array Int Int)) (v_ArrVal_10771 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_10767) c_~C~0.base v_ArrVal_10771) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_10767 (Array Int Int)) (v_ArrVal_10771 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~B~0.base v_ArrVal_10767) c_~C~0.base v_ArrVal_10771) c_~A~0.base) (+ c_~A~0.offset .cse1 1)))))) is different from false [2022-11-19 08:32:42,808 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse2 1)) (.cse3 (+ c_~A~0.offset 2 .cse2))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse3 0) (+ c_~A~0.offset 4) 0) (+ c_~A~0.offset 5) 0) (+ c_~A~0.offset 6) 0) (+ c_~A~0.offset 7) 0)))) (and (forall ((v_ArrVal_10767 (Array Int Int)) (v_ArrVal_10771 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_10767) c_~C~0.base v_ArrVal_10771) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_10767 (Array Int Int)) (v_ArrVal_10771 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~B~0.base v_ArrVal_10767) c_~C~0.base v_ArrVal_10771) c_~A~0.base) (+ c_~A~0.offset .cse2)))) (forall ((v_ArrVal_10767 (Array Int Int)) (v_ArrVal_10771 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_10767) c_~C~0.base v_ArrVal_10771) c_~A~0.base) .cse3) 0)))))) is different from false [2022-11-19 08:32:42,964 INFO L321 Elim1Store]: treesize reduction 407, result has 16.3 percent of original size [2022-11-19 08:32:42,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 96 [2022-11-19 08:32:42,986 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-19 08:32:42,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 224 treesize of output 158 [2022-11-19 08:32:42,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2022-11-19 08:32:43,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 78 [2022-11-19 08:32:43,086 INFO L321 Elim1Store]: treesize reduction 485, result has 0.2 percent of original size [2022-11-19 08:32:43,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 1 [2022-11-19 08:32:43,118 INFO L321 Elim1Store]: treesize reduction 485, result has 0.2 percent of original size [2022-11-19 08:32:43,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 1 [2022-11-19 08:32:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:32:43,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624965581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:32:43,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1399760086] [2022-11-19 08:32:43,499 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:32:43,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:32:43,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 31 [2022-11-19 08:32:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975959027] [2022-11-19 08:32:43,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:32:43,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 08:32:43,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 08:32:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=773, Unknown=22, NotChecked=118, Total=1056 [2022-11-19 08:32:43,501 INFO L87 Difference]: Start difference. First operand 36648 states and 150666 transitions. Second operand has 33 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:55,394 INFO L93 Difference]: Finished difference Result 96250 states and 395647 transitions. [2022-11-19 08:32:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 08:32:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 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 40 [2022-11-19 08:32:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:56,157 INFO L225 Difference]: With dead ends: 96250 [2022-11-19 08:32:56,157 INFO L226 Difference]: Without dead ends: 96246 [2022-11-19 08:32:56,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=984, Invalid=3141, Unknown=43, NotChecked=254, Total=4422 [2022-11-19 08:32:56,158 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1204 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 3525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2017 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:56,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 550 Invalid, 3525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1379 Invalid, 0 Unknown, 2017 Unchecked, 3.0s Time] [2022-11-19 08:32:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96246 states. [2022-11-19 08:32:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96246 to 62990. [2022-11-19 08:32:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62990 states, 62986 states have (on average 4.1570507731876924) internal successors, (261836), 62989 states have internal predecessors, (261836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62990 states to 62990 states and 261836 transitions. [2022-11-19 08:32:59,290 INFO L78 Accepts]: Start accepts. Automaton has 62990 states and 261836 transitions. Word has length 40 [2022-11-19 08:32:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:59,290 INFO L495 AbstractCegarLoop]: Abstraction has 62990 states and 261836 transitions. [2022-11-19 08:32:59,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:32:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 62990 states and 261836 transitions. [2022-11-19 08:32:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:32:59,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:59,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:59,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-19 08:32:59,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f1d8fb-3ea6-4621-82d2-6be6bf5750a2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-19 08:32:59,576 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:32:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1966522486, now seen corresponding path program 7 times [2022-11-19 08:32:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493786446] [2022-11-19 08:32:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat