./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs --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 e97ea8fdd79cc88ea5d66529f91fae4bb4475970931b09c5966dea7f1229156f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:59:04,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:59:04,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:59:04,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:59:04,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:59:04,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:59:04,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:59:04,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:59:04,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:59:04,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:59:04,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:59:04,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:59:04,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:59:04,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:59:04,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:59:04,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:59:04,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:59:04,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:59:04,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:59:04,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:59:04,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:59:04,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:59:04,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:59:04,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:59:04,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:59:04,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:59:04,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:59:04,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:59:04,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:59:04,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:59:04,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:59:04,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:59:04,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:59:04,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:59:04,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:59:04,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:59:04,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:59:04,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:59:04,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:59:04,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:59:04,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:59:04,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-19 13:59:04,648 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:59:04,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:59:04,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:59:04,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:59:04,650 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:59:04,650 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:59:04,651 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:59:04,651 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:59:04,651 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:59:04,651 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:59:04,658 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:59:04,658 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:59:04,658 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:59:04,659 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:59:04,659 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:59:04,659 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:59:04,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:59:04,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:59:04,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 13:59:04,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:59:04,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:59:04,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:59:04,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:59:04,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:59:04,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:59:04,662 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-19 13:59:04,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:59:04,662 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:59:04,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:59:04,664 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:59:04,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:59:04,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:59:04,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:59:04,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:59:04,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:59:04,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:59:04,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:59:04,665 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:59:04,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:59:04,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:59:04,666 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:59:04,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:59:04,666 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/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_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs 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 -> e97ea8fdd79cc88ea5d66529f91fae4bb4475970931b09c5966dea7f1229156f [2021-11-19 13:59:04,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:59:04,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:59:04,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:59:04,958 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:59:04,958 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:59:04,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2021-11-19 13:59:05,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/bc22d2f4e/4e06679d55b04e3c88811a443d0786c5/FLAG7c4015bad [2021-11-19 13:59:05,616 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:59:05,620 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2021-11-19 13:59:05,641 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/bc22d2f4e/4e06679d55b04e3c88811a443d0786c5/FLAG7c4015bad [2021-11-19 13:59:05,859 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/bc22d2f4e/4e06679d55b04e3c88811a443d0786c5 [2021-11-19 13:59:05,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:59:05,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:59:05,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:59:05,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:59:05,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:59:05,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:59:05" (1/1) ... [2021-11-19 13:59:05,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a322529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:05, skipping insertion in model container [2021-11-19 13:59:05,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:59:05" (1/1) ... [2021-11-19 13:59:05,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:59:05,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:59:06,413 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:59:06,431 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-19 13:59:06,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@63a9a40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:06, skipping insertion in model container [2021-11-19 13:59:06,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:59:06,432 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-19 13:59:06,434 INFO L158 Benchmark]: Toolchain (without parser) took 569.98ms. Allocated memory is still 153.1MB. Free memory was 110.8MB in the beginning and 122.9MB in the end (delta: -12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-19 13:59:06,436 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 153.1MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:59:06,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.31ms. Allocated memory is still 153.1MB. Free memory was 110.6MB in the beginning and 122.9MB in the end (delta: -12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-19 13:59:06,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 153.1MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.31ms. Allocated memory is still 153.1MB. Free memory was 110.6MB in the beginning and 122.9MB in the end (delta: -12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 920]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs --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 e97ea8fdd79cc88ea5d66529f91fae4bb4475970931b09c5966dea7f1229156f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:59:08,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:59:08,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:59:08,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:59:08,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:59:08,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:59:08,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:59:08,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:59:08,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:59:08,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:59:08,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:59:08,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:59:08,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:59:08,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:59:08,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:59:08,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:59:08,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:59:08,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:59:08,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:59:08,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:59:08,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:59:08,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:59:08,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:59:08,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:59:08,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:59:08,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:59:08,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:59:08,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:59:08,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:59:08,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:59:08,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:59:08,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:59:08,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:59:08,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:59:08,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:59:08,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:59:08,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:59:08,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:59:08,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:59:08,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:59:08,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:59:08,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf [2021-11-19 13:59:08,880 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:59:08,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:59:08,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:59:08,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:59:08,882 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:59:08,882 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:59:08,882 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:59:08,882 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:59:08,883 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:59:08,883 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:59:08,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:59:08,884 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:59:08,884 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 13:59:08,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:59:08,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:59:08,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:59:08,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:59:08,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:59:08,885 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-19 13:59:08,885 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:59:08,885 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 13:59:08,886 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 13:59:08,886 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:59:08,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:59:08,886 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:59:08,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:59:08,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:59:08,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 13:59:08,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:59:08,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:59:08,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:59:08,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:59:08,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:59:08,888 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 13:59:08,888 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 13:59:08,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:59:08,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:59:08,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:59:08,889 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/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_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs 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 -> e97ea8fdd79cc88ea5d66529f91fae4bb4475970931b09c5966dea7f1229156f [2021-11-19 13:59:09,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:59:09,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:59:09,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:59:09,315 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:59:09,316 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:59:09,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2021-11-19 13:59:09,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/b78b84e24/365d5d37b431490c91b9132bd15d0b8d/FLAG9ec6e209f [2021-11-19 13:59:09,970 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:59:09,971 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2021-11-19 13:59:10,001 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/b78b84e24/365d5d37b431490c91b9132bd15d0b8d/FLAG9ec6e209f [2021-11-19 13:59:10,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/data/b78b84e24/365d5d37b431490c91b9132bd15d0b8d [2021-11-19 13:59:10,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:59:10,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:59:10,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:59:10,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:59:10,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:59:10,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:59:10" (1/1) ... [2021-11-19 13:59:10,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb4e637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:10, skipping insertion in model container [2021-11-19 13:59:10,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:59:10" (1/1) ... [2021-11-19 13:59:10,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:59:10,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:59:10,929 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:59:10,952 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-19 13:59:10,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:59:11,015 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:59:11,027 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:59:11,086 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:59:11,208 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:59:11,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11 WrapperNode [2021-11-19 13:59:11,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:59:11,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:59:11,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:59:11,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:59:11,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,298 INFO L137 Inliner]: procedures = 262, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2021-11-19 13:59:11,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:59:11,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:59:11,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:59:11,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:59:11,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:59:11,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:59:11,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:59:11,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:59:11,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (1/1) ... [2021-11-19 13:59:11,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:59:11,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:59:11,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:59:11,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:59:11,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-19 13:59:11,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 13:59:11,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 13:59:11,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-19 13:59:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-19 13:59:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-19 13:59:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-19 13:59:11,455 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-19 13:59:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:59:11,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:59:11,457 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-19 13:59:11,659 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:59:11,661 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:59:11,920 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:59:11,927 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:59:11,927 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 13:59:11,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:59:11 BoogieIcfgContainer [2021-11-19 13:59:11,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:59:11,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:59:11,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:59:11,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:59:11,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:59:10" (1/3) ... [2021-11-19 13:59:11,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54288e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:59:11, skipping insertion in model container [2021-11-19 13:59:11,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:11" (2/3) ... [2021-11-19 13:59:11,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54288e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:59:11, skipping insertion in model container [2021-11-19 13:59:11,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:59:11" (3/3) ... [2021-11-19 13:59:11,937 INFO L111 eAbstractionObserver]: Analyzing ICFG 04-mutex_46-escape_nr.i [2021-11-19 13:59:11,942 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-19 13:59:11,943 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:59:11,943 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-19 13:59:11,943 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-19 13:59:11,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,970 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,970 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,971 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,971 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,971 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,972 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,972 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,972 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,972 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,972 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,973 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,973 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,974 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,974 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,975 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,975 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,975 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,976 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,976 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,976 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,976 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,977 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,977 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,977 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,978 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,979 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,979 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,979 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,979 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,979 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,980 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,980 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,980 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,980 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,980 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,981 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,981 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,981 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,981 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,982 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,983 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,983 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,983 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,983 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,983 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,984 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,985 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,985 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,985 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,985 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,985 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,986 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,986 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,986 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,986 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,986 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,987 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,987 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,987 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,988 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,988 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,988 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,989 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,989 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,989 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,990 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,990 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,990 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,990 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,991 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,991 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,992 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,992 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,997 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,997 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,998 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,998 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:11,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:59:12,003 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-19 13:59:12,046 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:59:12,052 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 13:59:12,053 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-19 13:59:12,066 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-19 13:59:12,078 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 98 transitions, 204 flow [2021-11-19 13:59:12,081 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 98 transitions, 204 flow [2021-11-19 13:59:12,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 204 flow [2021-11-19 13:59:12,135 INFO L129 PetriNetUnfolder]: 0/97 cut-off events. [2021-11-19 13:59:12,136 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-19 13:59:12,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 97 events. 0/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-11-19 13:59:12,141 INFO L116 LiptonReduction]: Number of co-enabled transitions 1612 [2021-11-19 13:59:19,770 INFO L131 LiptonReduction]: Checked pairs total: 10793 [2021-11-19 13:59:19,771 INFO L133 LiptonReduction]: Total number of compositions: 54 [2021-11-19 13:59:19,781 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 44 transitions, 96 flow [2021-11-19 13:59:19,828 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 408 states, 397 states have (on average 1.9471032745591939) internal successors, (773), 407 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 397 states have (on average 1.9471032745591939) internal successors, (773), 407 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-19 13:59:19,840 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:19,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:19,841 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1691409919, now seen corresponding path program 1 times [2021-11-19 13:59:19,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:19,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814481487] [2021-11-19 13:59:19,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:19,862 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:19,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:19,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:19,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 13:59:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:20,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:20,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:20,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:20,167 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:20,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 13:59:20,258 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:20,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 42 [2021-11-19 13:59:20,483 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:20,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 82 [2021-11-19 13:59:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:20,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:20,815 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:20,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814481487] [2021-11-19 13:59:20,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814481487] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:20,816 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:20,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-19 13:59:20,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233485138] [2021-11-19 13:59:20,834 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:20,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 13:59:20,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 13:59:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=26, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:20,861 INFO L87 Difference]: Start difference. First operand has 408 states, 397 states have (on average 1.9471032745591939) internal successors, (773), 407 states have internal predecessors, (773), 0 states have call successors, (0), 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 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:21,551 INFO L93 Difference]: Finished difference Result 461 states and 873 transitions. [2021-11-19 13:59:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-19 13:59:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:21,571 INFO L225 Difference]: With dead ends: 461 [2021-11-19 13:59:21,571 INFO L226 Difference]: Without dead ends: 461 [2021-11-19 13:59:21,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=26, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:21,575 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:21,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 240 Invalid, 0 Unknown, 19 Unchecked, 0.6s Time] [2021-11-19 13:59:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-19 13:59:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2021-11-19 13:59:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 436 states have (on average 1.9426605504587156) internal successors, (847), 446 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 847 transitions. [2021-11-19 13:59:21,658 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 847 transitions. Word has length 9 [2021-11-19 13:59:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:21,658 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 847 transitions. [2021-11-19 13:59:21,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 847 transitions. [2021-11-19 13:59:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-19 13:59:21,660 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:21,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:21,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:21,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:21,873 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2099919771, now seen corresponding path program 1 times [2021-11-19 13:59:21,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:21,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571575269] [2021-11-19 13:59:21,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:21,875 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:21,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:21,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 13:59:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:21,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:21,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:21,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:22,001 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:22,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-19 13:59:22,102 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:22,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 54 [2021-11-19 13:59:22,288 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:22,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 90 [2021-11-19 13:59:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:22,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:22,549 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:22,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571575269] [2021-11-19 13:59:22,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571575269] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:22,549 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:22,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-19 13:59:22,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429733974] [2021-11-19 13:59:22,550 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:22,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:59:22,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:59:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:59:22,552 INFO L87 Difference]: Start difference. First operand 447 states and 847 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 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) [2021-11-19 13:59:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:22,987 INFO L93 Difference]: Finished difference Result 623 states and 1191 transitions. [2021-11-19 13:59:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:22,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 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 9 [2021-11-19 13:59:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:22,995 INFO L225 Difference]: With dead ends: 623 [2021-11-19 13:59:22,995 INFO L226 Difference]: Without dead ends: 623 [2021-11-19 13:59:22,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:59:22,997 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:22,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2021-11-19 13:59:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-11-19 13:59:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 533. [2021-11-19 13:59:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 522 states have (on average 1.9444444444444444) internal successors, (1015), 532 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1015 transitions. [2021-11-19 13:59:23,035 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1015 transitions. Word has length 9 [2021-11-19 13:59:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:23,035 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 1015 transitions. [2021-11-19 13:59:23,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 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) [2021-11-19 13:59:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1015 transitions. [2021-11-19 13:59:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 13:59:23,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:23,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:23,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:23,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:23,250 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:23,250 INFO L85 PathProgramCache]: Analyzing trace with hash 730231185, now seen corresponding path program 1 times [2021-11-19 13:59:23,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:23,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745158174] [2021-11-19 13:59:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:23,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:23,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:23,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 13:59:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:23,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 13:59:23,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:23,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:23,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:23,410 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:23,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745158174] [2021-11-19 13:59:23,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745158174] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:23,411 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:23,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-19 13:59:23,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419050881] [2021-11-19 13:59:23,412 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:23,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:23,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:23,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:23,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:23,413 INFO L87 Difference]: Start difference. First operand 533 states and 1015 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:23,463 INFO L93 Difference]: Finished difference Result 202 states and 330 transitions. [2021-11-19 13:59:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:23,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-19 13:59:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:23,465 INFO L225 Difference]: With dead ends: 202 [2021-11-19 13:59:23,465 INFO L226 Difference]: Without dead ends: 202 [2021-11-19 13:59:23,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:23,467 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:23,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:59:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-19 13:59:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-11-19 13:59:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 194 states have (on average 1.7010309278350515) internal successors, (330), 201 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 330 transitions. [2021-11-19 13:59:23,477 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 330 transitions. Word has length 10 [2021-11-19 13:59:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:23,477 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 330 transitions. [2021-11-19 13:59:23,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 330 transitions. [2021-11-19 13:59:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 13:59:23,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:23,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:23,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:23,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:23,692 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1751287675, now seen corresponding path program 1 times [2021-11-19 13:59:23,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:23,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782376900] [2021-11-19 13:59:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:23,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:23,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:23,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 13:59:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:23,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:23,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:23,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:23,841 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:23,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-19 13:59:23,919 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:23,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 58 [2021-11-19 13:59:24,025 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:24,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 92 [2021-11-19 13:59:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:24,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:24,339 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:24,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782376900] [2021-11-19 13:59:24,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782376900] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:24,339 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:24,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-19 13:59:24,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071230993] [2021-11-19 13:59:24,340 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:24,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:59:24,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:59:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:59:24,342 INFO L87 Difference]: Start difference. First operand 202 states and 330 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:24,588 INFO L93 Difference]: Finished difference Result 200 states and 328 transitions. [2021-11-19 13:59:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:24,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 [2021-11-19 13:59:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:24,594 INFO L225 Difference]: With dead ends: 200 [2021-11-19 13:59:24,595 INFO L226 Difference]: Without dead ends: 200 [2021-11-19 13:59:24,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:59:24,596 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:24,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2021-11-19 13:59:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-19 13:59:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-11-19 13:59:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.690721649484536) internal successors, (328), 199 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 328 transitions. [2021-11-19 13:59:24,608 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 328 transitions. Word has length 15 [2021-11-19 13:59:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:24,608 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 328 transitions. [2021-11-19 13:59:24,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 328 transitions. [2021-11-19 13:59:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 13:59:24,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:24,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:24,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:24,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:24,823 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1791736579, now seen corresponding path program 1 times [2021-11-19 13:59:24,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:24,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271153622] [2021-11-19 13:59:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:24,824 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:24,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:24,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-19 13:59:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:24,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:24,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:24,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:24,964 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:24,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-19 13:59:25,022 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:25,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 51 [2021-11-19 13:59:25,118 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:25,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 85 [2021-11-19 13:59:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:25,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:25,332 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:25,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271153622] [2021-11-19 13:59:25,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271153622] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:25,332 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:25,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-19 13:59:25,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633867381] [2021-11-19 13:59:25,333 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:25,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:59:25,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:59:25,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:25,334 INFO L87 Difference]: Start difference. First operand 200 states and 328 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:25,746 INFO L93 Difference]: Finished difference Result 221 states and 366 transitions. [2021-11-19 13:59:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-19 13:59:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:25,749 INFO L225 Difference]: With dead ends: 221 [2021-11-19 13:59:25,749 INFO L226 Difference]: Without dead ends: 208 [2021-11-19 13:59:25,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:25,750 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:25,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 13:59:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-19 13:59:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-11-19 13:59:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.6896551724137931) internal successors, (343), 207 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 343 transitions. [2021-11-19 13:59:25,759 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 343 transitions. Word has length 15 [2021-11-19 13:59:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:25,759 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 343 transitions. [2021-11-19 13:59:25,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 343 transitions. [2021-11-19 13:59:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 13:59:25,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:25,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:25,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:25,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:25,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash 810783800, now seen corresponding path program 1 times [2021-11-19 13:59:25,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:25,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485213238] [2021-11-19 13:59:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:25,973 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:25,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:25,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:25,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-19 13:59:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:26,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:26,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:26,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:26,112 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:26,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 13:59:26,168 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:26,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 40 [2021-11-19 13:59:26,280 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:26,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 72 [2021-11-19 13:59:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:26,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:26,542 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:26,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485213238] [2021-11-19 13:59:26,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485213238] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:26,543 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:26,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-19 13:59:26,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258843617] [2021-11-19 13:59:26,543 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:26,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 13:59:26,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 13:59:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=26, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:26,545 INFO L87 Difference]: Start difference. First operand 208 states and 343 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:26,814 INFO L93 Difference]: Finished difference Result 275 states and 459 transitions. [2021-11-19 13:59:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:26,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 22 [2021-11-19 13:59:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:26,816 INFO L225 Difference]: With dead ends: 275 [2021-11-19 13:59:26,816 INFO L226 Difference]: Without dead ends: 240 [2021-11-19 13:59:26,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=26, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:26,817 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:26,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2021-11-19 13:59:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-19 13:59:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 230. [2021-11-19 13:59:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.8222222222222222) internal successors, (410), 229 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 410 transitions. [2021-11-19 13:59:26,828 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 410 transitions. Word has length 22 [2021-11-19 13:59:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:26,828 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 410 transitions. [2021-11-19 13:59:26,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 410 transitions. [2021-11-19 13:59:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 13:59:26,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:26,830 INFO L514 BasicCegarLoop]: 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] [2021-11-19 13:59:26,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:27,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:27,040 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash -632096898, now seen corresponding path program 1 times [2021-11-19 13:59:27,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:27,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294120294] [2021-11-19 13:59:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:27,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:27,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:27,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-19 13:59:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:27,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:27,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:27,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:27,193 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:27,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-19 13:59:27,284 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:27,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 57 [2021-11-19 13:59:27,423 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:27,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 86 [2021-11-19 13:59:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:27,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:27,680 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:27,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294120294] [2021-11-19 13:59:27,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294120294] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:27,680 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:27,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-19 13:59:27,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363719252] [2021-11-19 13:59:27,681 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:27,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:59:27,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:59:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:59:27,682 INFO L87 Difference]: Start difference. First operand 230 states and 410 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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) [2021-11-19 13:59:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:28,208 INFO L93 Difference]: Finished difference Result 258 states and 450 transitions. [2021-11-19 13:59:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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 23 [2021-11-19 13:59:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:28,211 INFO L225 Difference]: With dead ends: 258 [2021-11-19 13:59:28,211 INFO L226 Difference]: Without dead ends: 258 [2021-11-19 13:59:28,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:59:28,213 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:28,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 41 Unchecked, 0.4s Time] [2021-11-19 13:59:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-19 13:59:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2021-11-19 13:59:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.8170212765957447) internal successors, (427), 239 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 427 transitions. [2021-11-19 13:59:28,222 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 427 transitions. Word has length 23 [2021-11-19 13:59:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:28,223 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 427 transitions. [2021-11-19 13:59:28,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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) [2021-11-19 13:59:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 427 transitions. [2021-11-19 13:59:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 13:59:28,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:28,224 INFO L514 BasicCegarLoop]: 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] [2021-11-19 13:59:28,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-19 13:59:28,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:28,439 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:28,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -485525178, now seen corresponding path program 2 times [2021-11-19 13:59:28,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:28,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425974284] [2021-11-19 13:59:28,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 13:59:28,440 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:28,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:28,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:28,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-19 13:59:28,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 13:59:28,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:59:28,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:59:28,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:28,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:28,571 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:28,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 13:59:28,623 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:28,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 41 [2021-11-19 13:59:28,713 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:28,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 61 [2021-11-19 13:59:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:28,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:28,922 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:28,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425974284] [2021-11-19 13:59:28,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425974284] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:28,922 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:28,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-19 13:59:28,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073578570] [2021-11-19 13:59:28,923 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:28,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:59:28,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:59:28,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:28,923 INFO L87 Difference]: Start difference. First operand 240 states and 427 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:29,434 INFO L93 Difference]: Finished difference Result 273 states and 464 transitions. [2021-11-19 13:59:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:29,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 23 [2021-11-19 13:59:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:29,436 INFO L225 Difference]: With dead ends: 273 [2021-11-19 13:59:29,436 INFO L226 Difference]: Without dead ends: 261 [2021-11-19 13:59:29,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:29,437 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:29,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 19 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 275 Invalid, 0 Unknown, 19 Unchecked, 0.5s Time] [2021-11-19 13:59:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-19 13:59:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 219. [2021-11-19 13:59:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.794392523364486) internal successors, (384), 218 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 384 transitions. [2021-11-19 13:59:29,451 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 384 transitions. Word has length 23 [2021-11-19 13:59:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:29,452 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 384 transitions. [2021-11-19 13:59:29,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 384 transitions. [2021-11-19 13:59:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 13:59:29,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:29,456 INFO L514 BasicCegarLoop]: 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] [2021-11-19 13:59:29,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:29,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:29,670 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash -715181793, now seen corresponding path program 1 times [2021-11-19 13:59:29,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:29,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296009766] [2021-11-19 13:59:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:29,671 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:29,672 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:29,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-19 13:59:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:29,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 13:59:29,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:29,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 13:59:29,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:29,883 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:29,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2021-11-19 13:59:29,969 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:29,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2021-11-19 13:59:30,164 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:30,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 70 [2021-11-19 13:59:30,395 INFO L354 Elim1Store]: treesize reduction 168, result has 21.9 percent of original size [2021-11-19 13:59:30,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 84 treesize of output 104 [2021-11-19 13:59:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:30,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:36,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 29 [2021-11-19 13:59:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:36,873 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:36,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296009766] [2021-11-19 13:59:36,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296009766] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:36,874 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:36,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 13 [2021-11-19 13:59:36,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508242231] [2021-11-19 13:59:36,874 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:36,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-19 13:59:36,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-19 13:59:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-11-19 13:59:36,876 INFO L87 Difference]: Start difference. First operand 219 states and 384 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:37,455 INFO L93 Difference]: Finished difference Result 275 states and 471 transitions. [2021-11-19 13:59:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 13:59:37,456 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 13:59:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:37,458 INFO L225 Difference]: With dead ends: 275 [2021-11-19 13:59:37,458 INFO L226 Difference]: Without dead ends: 275 [2021-11-19 13:59:37,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-11-19 13:59:37,460 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:37,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 31 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 236 Invalid, 0 Unknown, 62 Unchecked, 0.5s Time] [2021-11-19 13:59:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-19 13:59:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 223. [2021-11-19 13:59:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.7935779816513762) internal successors, (391), 222 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 391 transitions. [2021-11-19 13:59:37,469 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 391 transitions. Word has length 25 [2021-11-19 13:59:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:37,469 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 391 transitions. [2021-11-19 13:59:37,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 391 transitions. [2021-11-19 13:59:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 13:59:37,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:37,471 INFO L514 BasicCegarLoop]: 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] [2021-11-19 13:59:37,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-19 13:59:37,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:59:37,684 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 13:59:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash -718122453, now seen corresponding path program 2 times [2021-11-19 13:59:37,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:59:37,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541147297] [2021-11-19 13:59:37,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 13:59:37,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:59:37,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:59:37,685 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:59:37,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-19 13:59:37,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 13:59:37,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:59:37,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 13:59:37,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:59:37,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 13:59:37,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 13:59:37,904 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 13:59:37,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 13:59:37,979 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 13:59:37,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-11-19 13:59:38,132 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 13:59:38,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 63 [2021-11-19 13:59:38,339 INFO L354 Elim1Store]: treesize reduction 168, result has 21.9 percent of original size [2021-11-19 13:59:38,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 71 treesize of output 91 [2021-11-19 13:59:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:38,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:59:40,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))) is different from false [2021-11-19 13:59:54,089 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse1 t_funThread1of1ForFork0_~p~0.base (store (select .cse1 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))) is different from false [2021-11-19 13:59:56,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) is different from false [2021-11-19 13:59:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:59:56,142 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:59:56,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541147297] [2021-11-19 13:59:56,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541147297] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:56,143 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:56,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 14 [2021-11-19 13:59:56,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177241475] [2021-11-19 13:59:56,143 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:56,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 13:59:56,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:59:56,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 13:59:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=99, Unknown=4, NotChecked=66, Total=210 [2021-11-19 13:59:56,145 INFO L87 Difference]: Start difference. First operand 223 states and 391 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:59:58,331 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|)) (= (_ bv0 1) (select (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|))) is different from false [2021-11-19 14:00:00,343 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|))) (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse1 t_funThread1of1ForFork0_~p~0.base (store (select .cse1 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))) (= (_ bv0 1) (bvneg (select .cse2 (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))) (= (_ bv0 1) (select .cse2 |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|)))) is different from false [2021-11-19 14:00:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:00:24,331 INFO L93 Difference]: Finished difference Result 400 states and 697 transitions. [2021-11-19 14:00:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-19 14:00:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 14:00:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:00:24,334 INFO L225 Difference]: With dead ends: 400 [2021-11-19 14:00:24,335 INFO L226 Difference]: Without dead ends: 396 [2021-11-19 14:00:24,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=103, Invalid=211, Unknown=12, NotChecked=180, Total=506 [2021-11-19 14:00:24,336 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 588 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 14:00:24,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 33 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 240 Invalid, 0 Unknown, 588 Unchecked, 0.6s Time] [2021-11-19 14:00:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-19 14:00:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2021-11-19 14:00:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.7965367965367964) internal successors, (415), 235 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:00:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 415 transitions. [2021-11-19 14:00:24,347 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 415 transitions. Word has length 25 [2021-11-19 14:00:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:00:24,347 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 415 transitions. [2021-11-19 14:00:24,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:00:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 415 transitions. [2021-11-19 14:00:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:00:24,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:00:24,348 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:00:24,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-19 14:00:24,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:00:24,549 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:00:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:00:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1773059029, now seen corresponding path program 3 times [2021-11-19 14:00:24,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:00:24,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723226281] [2021-11-19 14:00:24,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:00:24,551 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:00:24,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:00:24,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:00:24,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-19 14:00:24,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:00:24,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:00:24,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:00:24,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:00:24,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:00:24,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:00:24,816 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:00:24,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2021-11-19 14:00:24,988 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:00:24,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2021-11-19 14:00:25,096 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:00:25,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 76 [2021-11-19 14:00:25,304 INFO L354 Elim1Store]: treesize reduction 168, result has 21.9 percent of original size [2021-11-19 14:00:25,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 90 treesize of output 110 [2021-11-19 14:00:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:00:25,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:00:27,513 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:00:49,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:00:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:00:49,640 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:00:49,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723226281] [2021-11-19 14:00:49,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723226281] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:00:49,641 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:00:49,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 14 [2021-11-19 14:00:49,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605688805] [2021-11-19 14:00:49,641 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:00:49,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 14:00:49,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:00:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 14:00:49,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=112, Unknown=6, NotChecked=46, Total=210 [2021-11-19 14:00:49,643 INFO L87 Difference]: Start difference. First operand 236 states and 415 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:00:51,734 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|)) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (= (_ bv0 1) (select (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|))) is different from false [2021-11-19 14:00:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:00:54,902 INFO L93 Difference]: Finished difference Result 289 states and 514 transitions. [2021-11-19 14:00:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-19 14:00:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 14:00:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:00:54,905 INFO L225 Difference]: With dead ends: 289 [2021-11-19 14:00:54,905 INFO L226 Difference]: Without dead ends: 289 [2021-11-19 14:00:54,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=61, Invalid=154, Unknown=7, NotChecked=84, Total=306 [2021-11-19 14:00:54,906 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:00:54,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 533 Unchecked, 0.1s Time] [2021-11-19 14:00:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-19 14:00:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 236. [2021-11-19 14:00:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.7965367965367964) internal successors, (415), 235 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:00:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 415 transitions. [2021-11-19 14:00:54,919 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 415 transitions. Word has length 25 [2021-11-19 14:00:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:00:54,920 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 415 transitions. [2021-11-19 14:00:54,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:00:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 415 transitions. [2021-11-19 14:00:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:00:54,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:00:54,921 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:00:54,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-19 14:00:55,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:00:55,135 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:00:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:00:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1851707269, now seen corresponding path program 4 times [2021-11-19 14:00:55,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:00:55,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552395866] [2021-11-19 14:00:55,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:00:55,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:00:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:00:55,138 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:00:55,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-19 14:00:55,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:00:55,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:00:55,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:00:55,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:00:55,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:00:55,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:00:55,430 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:00:55,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-19 14:00:55,584 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:00:55,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2021-11-19 14:00:55,797 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:00:55,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 80 [2021-11-19 14:00:56,074 INFO L354 Elim1Store]: treesize reduction 168, result has 21.9 percent of original size [2021-11-19 14:00:56,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 90 treesize of output 110 [2021-11-19 14:00:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:00:56,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:00:58,403 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:01:22,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:01:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:22,239 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:22,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552395866] [2021-11-19 14:01:22,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552395866] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:22,240 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:22,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 14 [2021-11-19 14:01:22,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795968674] [2021-11-19 14:01:22,240 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:22,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 14:01:22,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 14:01:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=111, Unknown=7, NotChecked=46, Total=210 [2021-11-19 14:01:22,241 INFO L87 Difference]: Start difference. First operand 236 states and 415 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:24,334 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|)) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (= (_ bv0 1) (select (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|))) is different from false [2021-11-19 14:01:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:24,434 INFO L93 Difference]: Finished difference Result 268 states and 476 transitions. [2021-11-19 14:01:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-19 14:01:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 14:01:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:24,436 INFO L225 Difference]: With dead ends: 268 [2021-11-19 14:01:24,436 INFO L226 Difference]: Without dead ends: 268 [2021-11-19 14:01:24,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=52, Invalid=134, Unknown=8, NotChecked=78, Total=272 [2021-11-19 14:01:24,437 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:24,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 32 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 270 Unchecked, 0.1s Time] [2021-11-19 14:01:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-19 14:01:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2021-11-19 14:01:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.7965367965367964) internal successors, (415), 235 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 415 transitions. [2021-11-19 14:01:24,447 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 415 transitions. Word has length 25 [2021-11-19 14:01:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:24,447 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 415 transitions. [2021-11-19 14:01:24,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 415 transitions. [2021-11-19 14:01:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:01:24,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:24,448 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:01:24,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:24,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:01:24,663 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:01:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1643410419, now seen corresponding path program 5 times [2021-11-19 14:01:24,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:24,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174937902] [2021-11-19 14:01:24,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-19 14:01:24,665 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:24,666 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:24,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-19 14:01:24,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:01:24,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:01:24,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:01:24,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:24,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:01:24,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:01:24,888 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:01:24,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:01:24,972 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:01:24,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2021-11-19 14:01:25,076 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:01:25,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 60 [2021-11-19 14:01:25,239 INFO L354 Elim1Store]: treesize reduction 168, result has 21.9 percent of original size [2021-11-19 14:01:25,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 80 [2021-11-19 14:01:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:25,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:27,444 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:01:41,367 WARN L227 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:01:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:50,619 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:01:50,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174937902] [2021-11-19 14:01:50,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174937902] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:50,619 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:50,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 14 [2021-11-19 14:01:50,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918416935] [2021-11-19 14:01:50,620 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:50,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 14:01:50,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:01:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 14:01:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=124, Unknown=7, NotChecked=24, Total=210 [2021-11-19 14:01:50,621 INFO L87 Difference]: Start difference. First operand 236 states and 415 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:57,902 INFO L93 Difference]: Finished difference Result 463 states and 811 transitions. [2021-11-19 14:01:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-19 14:01:57,903 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 14:01:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:57,912 INFO L225 Difference]: With dead ends: 463 [2021-11-19 14:01:57,913 INFO L226 Difference]: Without dead ends: 458 [2021-11-19 14:01:57,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=113, Invalid=260, Unknown=11, NotChecked=36, Total=420 [2021-11-19 14:01:57,915 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 115 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:57,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 30 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 300 Invalid, 0 Unknown, 395 Unchecked, 0.7s Time] [2021-11-19 14:01:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-11-19 14:01:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 271. [2021-11-19 14:01:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 266 states have (on average 1.8233082706766917) internal successors, (485), 270 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 485 transitions. [2021-11-19 14:01:57,930 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 485 transitions. Word has length 25 [2021-11-19 14:01:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:57,930 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 485 transitions. [2021-11-19 14:01:57,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 485 transitions. [2021-11-19 14:01:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:01:57,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:57,933 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:01:57,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:58,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:01:58,151 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:01:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1561821519, now seen corresponding path program 6 times [2021-11-19 14:01:58,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:01:58,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385131980] [2021-11-19 14:01:58,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-19 14:01:58,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:01:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:01:58,153 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:01:58,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-19 14:01:58,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-11-19 14:01:58,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:01:58,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:01:58,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:58,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:01:58,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:01:58,449 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:01:58,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:01:58,527 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:01:58,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-19 14:01:58,654 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:01:58,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 78 [2021-11-19 14:01:58,970 INFO L354 Elim1Store]: treesize reduction 168, result has 21.9 percent of original size [2021-11-19 14:01:58,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 100 treesize of output 120 [2021-11-19 14:01:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:01:59,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:09,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 29 [2021-11-19 14:02:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:09,531 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:09,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385131980] [2021-11-19 14:02:09,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385131980] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:09,532 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:09,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 13 [2021-11-19 14:02:09,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127376005] [2021-11-19 14:02:09,532 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:09,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-19 14:02:09,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-19 14:02:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-11-19 14:02:09,534 INFO L87 Difference]: Start difference. First operand 271 states and 485 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:10,227 INFO L93 Difference]: Finished difference Result 302 states and 546 transitions. [2021-11-19 14:02:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:02:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 14:02:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:10,229 INFO L225 Difference]: With dead ends: 302 [2021-11-19 14:02:10,230 INFO L226 Difference]: Without dead ends: 302 [2021-11-19 14:02:10,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2021-11-19 14:02:10,231 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:10,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 10 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2021-11-19 14:02:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-19 14:02:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 267. [2021-11-19 14:02:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.8282442748091603) internal successors, (479), 266 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 479 transitions. [2021-11-19 14:02:10,242 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 479 transitions. Word has length 25 [2021-11-19 14:02:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:10,242 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 479 transitions. [2021-11-19 14:02:10,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 479 transitions. [2021-11-19 14:02:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 14:02:10,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:10,243 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:02:10,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-11-19 14:02:10,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:10,476 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:02:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1040182474, now seen corresponding path program 1 times [2021-11-19 14:02:10,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:10,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620195752] [2021-11-19 14:02:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:10,477 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:10,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:10,478 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:10,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-19 14:02:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:10,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:02:10,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:10,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:02:10,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:02:10,710 INFO L354 Elim1Store]: treesize reduction 22, result has 31.3 percent of original size [2021-11-19 14:02:10,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-19 14:02:10,809 INFO L354 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2021-11-19 14:02:10,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 55 [2021-11-19 14:02:11,033 INFO L354 Elim1Store]: treesize reduction 101, result has 24.6 percent of original size [2021-11-19 14:02:11,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 102 [2021-11-19 14:02:11,436 INFO L354 Elim1Store]: treesize reduction 160, result has 22.0 percent of original size [2021-11-19 14:02:11,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 125 treesize of output 145 [2021-11-19 14:02:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:11,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:19,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 28 [2021-11-19 14:02:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:19,687 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:19,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620195752] [2021-11-19 14:02:19,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620195752] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:19,688 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:19,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 13 [2021-11-19 14:02:19,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28892385] [2021-11-19 14:02:19,689 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:19,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-19 14:02:19,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-19 14:02:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-11-19 14:02:19,690 INFO L87 Difference]: Start difference. First operand 267 states and 479 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:21,201 INFO L93 Difference]: Finished difference Result 262 states and 469 transitions. [2021-11-19 14:02:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:02:21,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-11-19 14:02:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:21,203 INFO L225 Difference]: With dead ends: 262 [2021-11-19 14:02:21,204 INFO L226 Difference]: Without dead ends: 258 [2021-11-19 14:02:21,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2021-11-19 14:02:21,205 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:21,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 142 Unchecked, 0.4s Time] [2021-11-19 14:02:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-19 14:02:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2021-11-19 14:02:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 229 states have (on average 1.7641921397379912) internal successors, (404), 231 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 404 transitions. [2021-11-19 14:02:21,214 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 404 transitions. Word has length 25 [2021-11-19 14:02:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:21,214 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 404 transitions. [2021-11-19 14:02:21,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 404 transitions. [2021-11-19 14:02:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 14:02:21,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:21,216 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:02:21,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:21,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:21,430 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:02:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -694039101, now seen corresponding path program 1 times [2021-11-19 14:02:21,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:21,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181893990] [2021-11-19 14:02:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:21,431 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:21,433 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:21,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-19 14:02:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:21,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 14:02:21,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:21,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:02:21,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:02:21,685 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:02:21,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:02:21,765 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:02:21,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-19 14:02:22,019 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:02:22,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 63 [2021-11-19 14:02:22,208 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:02:22,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 92 [2021-11-19 14:02:22,518 INFO L354 Elim1Store]: treesize reduction 255, result has 18.3 percent of original size [2021-11-19 14:02:22,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 142 [2021-11-19 14:02:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:22,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:25,126 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) is different from false [2021-11-19 14:02:36,198 WARN L227 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:02:48,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))) is different from false [2021-11-19 14:02:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:48,625 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:02:48,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181893990] [2021-11-19 14:02:48,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181893990] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:02:48,625 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:02:48,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 17 [2021-11-19 14:02:48,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759774672] [2021-11-19 14:02:48,625 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:48,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 14:02:48,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:02:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 14:02:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=174, Unknown=5, NotChecked=58, Total=306 [2021-11-19 14:02:48,639 INFO L87 Difference]: Start difference. First operand 232 states and 404 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:53,940 INFO L93 Difference]: Finished difference Result 277 states and 477 transitions. [2021-11-19 14:02:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:02:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-11-19 14:02:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:53,942 INFO L225 Difference]: With dead ends: 277 [2021-11-19 14:02:53,942 INFO L226 Difference]: Without dead ends: 277 [2021-11-19 14:02:53,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=133, Invalid=332, Unknown=5, NotChecked=82, Total=552 [2021-11-19 14:02:53,943 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:53,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 27 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 297 Unchecked, 0.3s Time] [2021-11-19 14:02:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-19 14:02:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 233. [2021-11-19 14:02:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 230 states have (on average 1.7608695652173914) internal successors, (405), 232 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 405 transitions. [2021-11-19 14:02:53,951 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 405 transitions. Word has length 26 [2021-11-19 14:02:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:53,952 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 405 transitions. [2021-11-19 14:02:53,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:02:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 405 transitions. [2021-11-19 14:02:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 14:02:53,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:53,953 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:02:53,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:54,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:02:54,167 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:02:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -695797731, now seen corresponding path program 2 times [2021-11-19 14:02:54,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:02:54,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561609056] [2021-11-19 14:02:54,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 14:02:54,169 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:02:54,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:02:54,170 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:02:54,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-19 14:02:54,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:02:54,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:02:54,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 14:02:54,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:54,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:02:54,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:02:54,369 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:02:54,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:02:54,430 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:02:54,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2021-11-19 14:02:54,638 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:02:54,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 73 [2021-11-19 14:02:54,744 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-19 14:02:54,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 95 [2021-11-19 14:02:54,975 INFO L354 Elim1Store]: treesize reduction 255, result has 18.3 percent of original size [2021-11-19 14:02:54,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 131 [2021-11-19 14:02:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:02:55,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:57,417 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))) (_ bv0 1))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (select (select (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))) is different from false [2021-11-19 14:03:07,641 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:03:20,048 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse1 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse1 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) is different from false [2021-11-19 14:03:22,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) is different from false [2021-11-19 14:03:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:22,107 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:03:22,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561609056] [2021-11-19 14:03:22,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561609056] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:03:22,108 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:03:22,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 16 [2021-11-19 14:03:22,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719593696] [2021-11-19 14:03:22,108 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:03:22,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-19 14:03:22,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:03:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-19 14:03:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=137, Unknown=4, NotChecked=78, Total=272 [2021-11-19 14:03:22,109 INFO L87 Difference]: Start difference. First operand 233 states and 405 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:24,365 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|)) (= (_ bv0 1) (select (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|))) is different from false [2021-11-19 14:03:26,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|))) (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (= (_ bv0 1) (bvneg (select .cse1 (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))) (= (_ bv0 1) (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|)))) is different from false [2021-11-19 14:03:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:32,771 INFO L93 Difference]: Finished difference Result 275 states and 469 transitions. [2021-11-19 14:03:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 14:03:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-11-19 14:03:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:32,774 INFO L225 Difference]: With dead ends: 275 [2021-11-19 14:03:32,774 INFO L226 Difference]: Without dead ends: 275 [2021-11-19 14:03:32,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=70, Invalid=183, Unknown=7, NotChecked=160, Total=420 [2021-11-19 14:03:32,776 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:32,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 29 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 546 Unchecked, 0.4s Time] [2021-11-19 14:03:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-19 14:03:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 234. [2021-11-19 14:03:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 231 states have (on average 1.7575757575757576) internal successors, (406), 233 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 406 transitions. [2021-11-19 14:03:32,786 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 406 transitions. Word has length 26 [2021-11-19 14:03:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:32,786 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 406 transitions. [2021-11-19 14:03:32,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 406 transitions. [2021-11-19 14:03:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 14:03:32,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:32,789 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:03:32,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-19 14:03:33,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:03:33,003 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:03:33,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash -786958191, now seen corresponding path program 3 times [2021-11-19 14:03:33,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:03:33,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127330363] [2021-11-19 14:03:33,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:03:33,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:03:33,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:03:33,005 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:03:33,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-19 14:03:33,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:03:33,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:03:33,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 14:03:33,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:33,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:03:33,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:03:33,307 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:03:33,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-19 14:03:33,427 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:03:33,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2021-11-19 14:03:33,722 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:03:33,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 89 [2021-11-19 14:03:34,096 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-19 14:03:34,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 135 [2021-11-19 14:03:34,573 INFO L354 Elim1Store]: treesize reduction 255, result has 18.3 percent of original size [2021-11-19 14:03:34,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 176 [2021-11-19 14:03:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:34,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:41,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 29 [2021-11-19 14:03:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:41,807 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:03:41,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127330363] [2021-11-19 14:03:41,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127330363] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:03:41,807 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:03:41,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 15 [2021-11-19 14:03:41,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092662598] [2021-11-19 14:03:41,807 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:03:41,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-19 14:03:41,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:03:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-19 14:03:41,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-11-19 14:03:41,809 INFO L87 Difference]: Start difference. First operand 234 states and 406 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:42,562 INFO L93 Difference]: Finished difference Result 284 states and 478 transitions. [2021-11-19 14:03:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:03:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-11-19 14:03:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:42,565 INFO L225 Difference]: With dead ends: 284 [2021-11-19 14:03:42,566 INFO L226 Difference]: Without dead ends: 284 [2021-11-19 14:03:42,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-11-19 14:03:42,567 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:42,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 29 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 230 Invalid, 0 Unknown, 230 Unchecked, 0.6s Time] [2021-11-19 14:03:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-19 14:03:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 231. [2021-11-19 14:03:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 228 states have (on average 1.7543859649122806) internal successors, (400), 230 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 400 transitions. [2021-11-19 14:03:42,577 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 400 transitions. Word has length 26 [2021-11-19 14:03:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:42,577 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 400 transitions. [2021-11-19 14:03:42,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:03:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 400 transitions. [2021-11-19 14:03:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 14:03:42,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:42,579 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:03:42,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-19 14:03:42,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:03:42,792 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:03:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 913510261, now seen corresponding path program 4 times [2021-11-19 14:03:42,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:03:42,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560302444] [2021-11-19 14:03:42,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:03:42,793 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:03:42,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:03:42,794 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:03:42,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-19 14:03:42,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:03:42,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:03:42,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 14:03:42,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:42,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:03:42,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:03:43,032 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:03:43,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-19 14:03:43,172 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 14:03:43,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 43 [2021-11-19 14:03:43,281 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:03:43,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2021-11-19 14:03:43,490 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:03:43,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 96 [2021-11-19 14:03:43,892 INFO L354 Elim1Store]: treesize reduction 255, result has 18.3 percent of original size [2021-11-19 14:03:43,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 143 [2021-11-19 14:03:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:03:44,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:46,681 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))))))) is different from false [2021-11-19 14:03:48,800 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))) is different from false [2021-11-19 14:04:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:04:03,176 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:04:03,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560302444] [2021-11-19 14:04:03,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560302444] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:04:03,177 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:04:03,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 17 [2021-11-19 14:04:03,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505387430] [2021-11-19 14:04:03,177 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:04:03,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 14:04:03,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:04:03,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 14:04:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=175, Unknown=4, NotChecked=58, Total=306 [2021-11-19 14:04:03,178 INFO L87 Difference]: Start difference. First operand 231 states and 400 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:04:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:04:08,577 INFO L93 Difference]: Finished difference Result 304 states and 513 transitions. [2021-11-19 14:04:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-19 14:04:08,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-11-19 14:04:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:04:08,580 INFO L225 Difference]: With dead ends: 304 [2021-11-19 14:04:08,580 INFO L226 Difference]: Without dead ends: 304 [2021-11-19 14:04:08,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=116, Invalid=308, Unknown=4, NotChecked=78, Total=506 [2021-11-19 14:04:08,581 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 14:04:08,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 29 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 428 Unchecked, 0.8s Time] [2021-11-19 14:04:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-19 14:04:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 233. [2021-11-19 14:04:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 230 states have (on average 1.7608695652173914) internal successors, (405), 232 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:04:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 405 transitions. [2021-11-19 14:04:08,591 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 405 transitions. Word has length 26 [2021-11-19 14:04:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:04:08,591 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 405 transitions. [2021-11-19 14:04:08,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:04:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 405 transitions. [2021-11-19 14:04:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 14:04:08,592 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:04:08,593 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:04:08,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-19 14:04:08,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:04:08,810 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:04:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:04:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2010448897, now seen corresponding path program 5 times [2021-11-19 14:04:08,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:04:08,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456494504] [2021-11-19 14:04:08,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-19 14:04:08,811 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:04:08,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:04:08,812 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:04:08,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-19 14:04:08,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:04:08,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:04:08,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 14:04:08,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:04:08,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:04:09,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:04:09,081 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:04:09,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-19 14:04:09,145 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 14:04:09,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 40 [2021-11-19 14:04:09,257 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:04:09,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2021-11-19 14:04:09,417 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:04:09,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 98 [2021-11-19 14:04:09,742 INFO L354 Elim1Store]: treesize reduction 255, result has 18.3 percent of original size [2021-11-19 14:04:09,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 153 [2021-11-19 14:04:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:04:09,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:04:12,795 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:04:14,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:04:16,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) is different from false [2021-11-19 14:04:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:04:16,918 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:04:16,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456494504] [2021-11-19 14:04:16,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456494504] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:04:16,919 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:04:16,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 17 [2021-11-19 14:04:16,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496125207] [2021-11-19 14:04:16,919 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:04:16,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 14:04:16,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:04:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 14:04:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=157, Unknown=3, NotChecked=84, Total=306 [2021-11-19 14:04:16,920 INFO L87 Difference]: Start difference. First operand 233 states and 405 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:04:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:04:30,768 INFO L93 Difference]: Finished difference Result 513 states and 852 transitions. [2021-11-19 14:04:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-19 14:04:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-11-19 14:04:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:04:30,773 INFO L225 Difference]: With dead ends: 513 [2021-11-19 14:04:30,773 INFO L226 Difference]: Without dead ends: 480 [2021-11-19 14:04:30,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=339, Invalid=792, Unknown=3, NotChecked=198, Total=1332 [2021-11-19 14:04:30,776 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 117 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-19 14:04:30,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 9 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 428 Invalid, 0 Unknown, 650 Unchecked, 1.9s Time] [2021-11-19 14:04:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-19 14:04:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 275. [2021-11-19 14:04:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 272 states have (on average 1.75) internal successors, (476), 274 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:04:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 476 transitions. [2021-11-19 14:04:30,797 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 476 transitions. Word has length 26 [2021-11-19 14:04:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:04:30,797 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 476 transitions. [2021-11-19 14:04:30,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:04:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 476 transitions. [2021-11-19 14:04:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 14:04:30,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:04:30,799 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:04:30,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-19 14:04:31,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:04:31,016 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:04:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:04:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -550119251, now seen corresponding path program 6 times [2021-11-19 14:04:31,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:04:31,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55524310] [2021-11-19 14:04:31,017 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-19 14:04:31,017 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:04:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:04:31,018 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:04:31,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-19 14:04:31,177 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-11-19 14:04:31,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:04:31,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 14:04:31,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:04:31,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:04:31,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:04:31,302 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:04:31,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:04:31,359 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 14:04:31,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2021-11-19 14:04:31,449 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:04:31,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 54 [2021-11-19 14:04:31,614 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:04:31,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 83 [2021-11-19 14:04:31,849 INFO L354 Elim1Store]: treesize reduction 255, result has 18.3 percent of original size [2021-11-19 14:04:31,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 118 [2021-11-19 14:04:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:04:32,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:04:53,951 WARN L227 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:05:11,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))))) is different from false [2021-11-19 14:05:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:05:11,385 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:05:11,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55524310] [2021-11-19 14:05:11,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55524310] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:05:11,386 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:05:11,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 17 [2021-11-19 14:05:11,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207787859] [2021-11-19 14:05:11,386 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:05:11,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 14:05:11,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:05:11,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 14:05:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=189, Unknown=9, NotChecked=30, Total=306 [2021-11-19 14:05:11,388 INFO L87 Difference]: Start difference. First operand 275 states and 476 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:05:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:05:39,465 INFO L93 Difference]: Finished difference Result 661 states and 1058 transitions. [2021-11-19 14:05:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-19 14:05:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-11-19 14:05:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:05:39,470 INFO L225 Difference]: With dead ends: 661 [2021-11-19 14:05:39,470 INFO L226 Difference]: Without dead ends: 655 [2021-11-19 14:05:39,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 65.6s TimeCoverageRelationStatistics Valid=364, Invalid=749, Unknown=13, NotChecked=64, Total=1190 [2021-11-19 14:05:39,471 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-19 14:05:39,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 29 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 537 Invalid, 0 Unknown, 409 Unchecked, 1.8s Time] [2021-11-19 14:05:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-11-19 14:05:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 272. [2021-11-19 14:05:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 269 states have (on average 1.7397769516728625) internal successors, (468), 271 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:05:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 468 transitions. [2021-11-19 14:05:39,483 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 468 transitions. Word has length 26 [2021-11-19 14:05:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:05:39,483 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 468 transitions. [2021-11-19 14:05:39,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:05:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 468 transitions. [2021-11-19 14:05:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:05:39,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:05:39,485 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:05:39,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-19 14:05:39,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:05:39,700 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:05:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:05:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -38586788, now seen corresponding path program 1 times [2021-11-19 14:05:39,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:05:39,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817001327] [2021-11-19 14:05:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:05:39,702 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:05:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:05:39,703 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:05:39,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-19 14:05:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:05:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 14:05:39,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:05:39,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:05:39,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:05:39,900 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:05:39,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:05:39,968 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:05:39,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-11-19 14:05:40,144 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:05:40,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 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 [2021-11-19 14:05:40,248 INFO L354 Elim1Store]: treesize reduction 50, result has 16.7 percent of original size [2021-11-19 14:05:40,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 74 [2021-11-19 14:05:40,436 INFO L354 Elim1Store]: treesize reduction 105, result has 25.0 percent of original size [2021-11-19 14:05:40,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 91 treesize of output 111 [2021-11-19 14:05:40,837 INFO L354 Elim1Store]: treesize reduction 350, result has 16.5 percent of original size [2021-11-19 14:05:40,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 case distinctions, treesize of input 137 treesize of output 169 [2021-11-19 14:05:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:05:41,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:05:43,831 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))))) is different from false [2021-11-19 14:05:57,227 WARN L227 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:05:59,293 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse5 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse3 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))))) is different from false [2021-11-19 14:06:01,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:06:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:01,391 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:06:01,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817001327] [2021-11-19 14:06:01,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817001327] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:06:01,392 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:06:01,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-19 14:06:01,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611140032] [2021-11-19 14:06:01,392 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:06:01,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:06:01,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:06:01,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:06:01,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=201, Unknown=3, NotChecked=96, Total=380 [2021-11-19 14:06:01,393 INFO L87 Difference]: Start difference. First operand 272 states and 468 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:06:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:12,184 INFO L93 Difference]: Finished difference Result 349 states and 580 transitions. [2021-11-19 14:06:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-19 14:06:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 27 [2021-11-19 14:06:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:12,187 INFO L225 Difference]: With dead ends: 349 [2021-11-19 14:06:12,187 INFO L226 Difference]: Without dead ends: 349 [2021-11-19 14:06:12,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=118, Invalid=353, Unknown=3, NotChecked=126, Total=600 [2021-11-19 14:06:12,188 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:12,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 27 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 492 Unchecked, 1.4s Time] [2021-11-19 14:06:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-19 14:06:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 282. [2021-11-19 14:06:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 279 states have (on average 1.7311827956989247) internal successors, (483), 281 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:06:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 483 transitions. [2021-11-19 14:06:12,198 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 483 transitions. Word has length 27 [2021-11-19 14:06:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:12,198 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 483 transitions. [2021-11-19 14:06:12,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:06:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2021-11-19 14:06:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:06:12,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:06:12,200 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:06:12,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:12,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:06:12,416 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:06:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:06:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1248638568, now seen corresponding path program 2 times [2021-11-19 14:06:12,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:06:12,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306000] [2021-11-19 14:06:12,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 14:06:12,417 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:06:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:06:12,418 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:06:12,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-19 14:06:12,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:06:12,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:06:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 14:06:12,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:06:12,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:06:12,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:06:12,617 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:06:12,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-19 14:06:12,779 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:06:12,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2021-11-19 14:06:12,889 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:06:12,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 71 [2021-11-19 14:06:13,032 INFO L354 Elim1Store]: treesize reduction 50, result has 16.7 percent of original size [2021-11-19 14:06:13,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 96 [2021-11-19 14:06:13,244 INFO L354 Elim1Store]: treesize reduction 105, result has 25.0 percent of original size [2021-11-19 14:06:13,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 126 [2021-11-19 14:06:13,681 INFO L354 Elim1Store]: treesize reduction 350, result has 16.5 percent of original size [2021-11-19 14:06:13,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 case distinctions, treesize of input 154 treesize of output 186 [2021-11-19 14:06:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:06:14,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:16,623 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))) is different from false [2021-11-19 14:06:18,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse5 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse3 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))))) is different from false [2021-11-19 14:07:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:07:06,270 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:07:06,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306000] [2021-11-19 14:07:06,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306000] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:07:06,271 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:07:06,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-19 14:07:06,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776123025] [2021-11-19 14:07:06,271 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:07:06,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:07:06,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:07:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:07:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=207, Unknown=19, NotChecked=66, Total=380 [2021-11-19 14:07:06,272 INFO L87 Difference]: Start difference. First operand 282 states and 483 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:07:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:07:22,291 INFO L93 Difference]: Finished difference Result 312 states and 530 transitions. [2021-11-19 14:07:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-19 14:07:22,292 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 27 [2021-11-19 14:07:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:07:22,294 INFO L225 Difference]: With dead ends: 312 [2021-11-19 14:07:22,294 INFO L226 Difference]: Without dead ends: 312 [2021-11-19 14:07:22,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 68.1s TimeCoverageRelationStatistics Valid=133, Invalid=359, Unknown=22, NotChecked=86, Total=600 [2021-11-19 14:07:22,295 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:07:22,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 30 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 305 Unchecked, 0.3s Time] [2021-11-19 14:07:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-11-19 14:07:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 283. [2021-11-19 14:07:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 280 states have (on average 1.7321428571428572) internal successors, (485), 282 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:07:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 485 transitions. [2021-11-19 14:07:22,310 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 485 transitions. Word has length 27 [2021-11-19 14:07:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:07:22,310 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 485 transitions. [2021-11-19 14:07:22,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:07:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 485 transitions. [2021-11-19 14:07:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:07:22,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:07:22,312 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:07:22,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-19 14:07:22,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:07:22,528 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:07:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:07:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1246851108, now seen corresponding path program 3 times [2021-11-19 14:07:22,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:07:22,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062706784] [2021-11-19 14:07:22,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:07:22,529 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:07:22,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:07:22,530 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:07:22,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-19 14:07:22,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:07:22,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:07:22,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 14:07:22,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:07:22,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:07:22,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:07:22,736 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:07:22,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:07:22,856 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:07:22,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-11-19 14:07:22,930 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:07:22,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2021-11-19 14:07:23,087 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:07:23,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 77 [2021-11-19 14:07:23,272 INFO L354 Elim1Store]: treesize reduction 84, result has 10.6 percent of original size [2021-11-19 14:07:23,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 90 treesize of output 104 [2021-11-19 14:07:23,655 INFO L354 Elim1Store]: treesize reduction 350, result has 16.5 percent of original size [2021-11-19 14:07:23,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 case distinctions, treesize of input 126 treesize of output 158 [2021-11-19 14:07:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:07:23,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:07:28,102 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))) is different from false [2021-11-19 14:07:30,215 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse5 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse3 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:07:32,304 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse5 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse3 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:07:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:07:51,037 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:07:51,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062706784] [2021-11-19 14:07:51,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062706784] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:07:51,037 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:07:51,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-19 14:07:51,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727231749] [2021-11-19 14:07:51,038 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:07:51,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:07:51,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:07:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:07:51,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=194, Unknown=11, NotChecked=96, Total=380 [2021-11-19 14:07:51,039 INFO L87 Difference]: Start difference. First operand 283 states and 485 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:08:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:08:11,885 INFO L93 Difference]: Finished difference Result 316 states and 532 transitions. [2021-11-19 14:08:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-19 14:08:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 27 [2021-11-19 14:08:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:08:11,888 INFO L225 Difference]: With dead ends: 316 [2021-11-19 14:08:11,888 INFO L226 Difference]: Without dead ends: 316 [2021-11-19 14:08:11,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=12, NotChecked=132, Total=650 [2021-11-19 14:08:11,889 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:08:11,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 30 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 364 Invalid, 0 Unknown, 470 Unchecked, 1.1s Time] [2021-11-19 14:08:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-19 14:08:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 282. [2021-11-19 14:08:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 279 states have (on average 1.7311827956989247) internal successors, (483), 281 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:08:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 483 transitions. [2021-11-19 14:08:11,899 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 483 transitions. Word has length 27 [2021-11-19 14:08:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:08:11,899 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 483 transitions. [2021-11-19 14:08:11,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:08:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2021-11-19 14:08:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:08:11,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:08:11,901 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:08:11,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-19 14:08:12,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:08:12,127 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:08:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:08:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1317876040, now seen corresponding path program 4 times [2021-11-19 14:08:12,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:08:12,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181510239] [2021-11-19 14:08:12,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:08:12,129 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:08:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:08:12,130 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:08:12,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-19 14:08:12,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:08:12,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:08:12,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 14:08:12,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:08:12,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:08:12,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:08:12,385 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:08:12,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:08:12,491 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:08:12,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-11-19 14:08:12,600 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:08:12,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 54 [2021-11-19 14:08:12,718 INFO L354 Elim1Store]: treesize reduction 50, result has 16.7 percent of original size [2021-11-19 14:08:12,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 73 [2021-11-19 14:08:12,906 INFO L354 Elim1Store]: treesize reduction 105, result has 25.0 percent of original size [2021-11-19 14:08:12,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 90 treesize of output 110 [2021-11-19 14:08:13,299 INFO L354 Elim1Store]: treesize reduction 350, result has 16.5 percent of original size [2021-11-19 14:08:13,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 case distinctions, treesize of input 130 treesize of output 162 [2021-11-19 14:08:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:08:13,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:08:33,327 WARN L227 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:08:56,612 WARN L227 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:08:58,681 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse5 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse3 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))))) is different from false [2021-11-19 14:09:00,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:09:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:09:01,015 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:09:01,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181510239] [2021-11-19 14:09:01,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181510239] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:09:01,015 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:09:01,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-19 14:09:01,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118765342] [2021-11-19 14:09:01,015 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:09:01,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:09:01,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:09:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:09:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=218, Unknown=9, NotChecked=66, Total=380 [2021-11-19 14:09:01,016 INFO L87 Difference]: Start difference. First operand 282 states and 483 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:09:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:09:08,196 INFO L93 Difference]: Finished difference Result 330 states and 561 transitions. [2021-11-19 14:09:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-19 14:09:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 27 [2021-11-19 14:09:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:09:08,200 INFO L225 Difference]: With dead ends: 330 [2021-11-19 14:09:08,200 INFO L226 Difference]: Without dead ends: 330 [2021-11-19 14:09:08,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=117, Invalid=344, Unknown=9, NotChecked=82, Total=552 [2021-11-19 14:09:08,201 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:09:08,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 29 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 172 Unchecked, 0.3s Time] [2021-11-19 14:09:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-19 14:09:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 284. [2021-11-19 14:09:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 281 states have (on average 1.7330960854092528) internal successors, (487), 283 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:09:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 487 transitions. [2021-11-19 14:09:08,211 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 487 transitions. Word has length 27 [2021-11-19 14:09:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:09:08,211 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 487 transitions. [2021-11-19 14:09:08,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:09:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 487 transitions. [2021-11-19 14:09:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:09:08,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:09:08,212 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:09:08,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-19 14:09:08,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:09:08,429 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:09:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:09:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1319663500, now seen corresponding path program 5 times [2021-11-19 14:09:08,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:09:08,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947392091] [2021-11-19 14:09:08,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-19 14:09:08,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:09:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:09:08,431 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:09:08,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-19 14:09:08,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:09:08,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:09:08,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 14:09:08,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:09:08,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2021-11-19 14:09:08,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:09:08,698 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:09:08,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:09:08,826 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:09:08,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-19 14:09:08,953 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:09:08,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2021-11-19 14:09:09,107 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:09:09,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 87 [2021-11-19 14:09:09,318 INFO L354 Elim1Store]: treesize reduction 84, result has 10.6 percent of original size [2021-11-19 14:09:09,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 130 [2021-11-19 14:09:09,774 INFO L354 Elim1Store]: treesize reduction 350, result has 16.5 percent of original size [2021-11-19 14:09:09,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 case distinctions, treesize of input 152 treesize of output 184 [2021-11-19 14:09:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:09:10,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:09:14,833 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))) is different from false [2021-11-19 14:09:16,980 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 c_t_funThread1of1ForFork0_~p~0.base (store (select .cse5 c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse3 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:09:36,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) is different from false [2021-11-19 14:09:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:09:36,467 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:09:36,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947392091] [2021-11-19 14:09:36,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947392091] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:09:36,468 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:09:36,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2021-11-19 14:09:36,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297444042] [2021-11-19 14:09:36,468 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:09:36,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 14:09:36,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:09:36,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 14:09:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=197, Unknown=9, NotChecked=96, Total=380 [2021-11-19 14:09:36,470 INFO L87 Difference]: Start difference. First operand 284 states and 487 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:09:55,169 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-19 14:09:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:09:55,261 INFO L93 Difference]: Finished difference Result 516 states and 833 transitions. [2021-11-19 14:09:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-19 14:09:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 27 [2021-11-19 14:09:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:09:55,266 INFO L225 Difference]: With dead ends: 516 [2021-11-19 14:09:55,266 INFO L226 Difference]: Without dead ends: 516 [2021-11-19 14:09:55,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=316, Invalid=742, Unknown=10, NotChecked=192, Total=1260 [2021-11-19 14:09:55,267 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 116 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:09:55,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 28 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 353 Invalid, 1 Unknown, 419 Unchecked, 3.3s Time] [2021-11-19 14:09:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-11-19 14:09:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 283. [2021-11-19 14:09:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 280 states have (on average 1.7321428571428572) internal successors, (485), 282 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:09:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 485 transitions. [2021-11-19 14:09:55,279 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 485 transitions. Word has length 27 [2021-11-19 14:09:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:09:55,280 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 485 transitions. [2021-11-19 14:09:55,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:09:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 485 transitions. [2021-11-19 14:09:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:09:55,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:09:55,281 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:09:55,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-11-19 14:09:55,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:09:55,498 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:09:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:09:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1374181030, now seen corresponding path program 6 times [2021-11-19 14:09:55,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:09:55,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395580694] [2021-11-19 14:09:55,499 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-19 14:09:55,499 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:09:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:09:55,500 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:09:55,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-19 14:09:55,641 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-11-19 14:09:55,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:09:55,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-19 14:09:55,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:09:55,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2021-11-19 14:09:55,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:09:55,790 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:09:55,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:09:55,922 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:09:55,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-11-19 14:09:56,098 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:09:56,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 63 [2021-11-19 14:09:56,219 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-19 14:09:56,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 77 [2021-11-19 14:09:56,372 INFO L354 Elim1Store]: treesize reduction 84, result has 10.6 percent of original size [2021-11-19 14:09:56,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 99 [2021-11-19 14:09:56,715 INFO L354 Elim1Store]: treesize reduction 350, result has 16.5 percent of original size [2021-11-19 14:09:56,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 case distinctions, treesize of input 115 treesize of output 147 [2021-11-19 14:09:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:09:57,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:10:07,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 27 [2021-11-19 14:10:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:10:07,827 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:10:07,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395580694] [2021-11-19 14:10:07,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395580694] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:10:07,827 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:10:07,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 17 [2021-11-19 14:10:07,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520897762] [2021-11-19 14:10:07,828 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:10:07,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-19 14:10:07,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:10:07,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-19 14:10:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-11-19 14:10:07,829 INFO L87 Difference]: Start difference. First operand 283 states and 485 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:10:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:10:12,305 INFO L93 Difference]: Finished difference Result 387 states and 634 transitions. [2021-11-19 14:10:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 14:10:12,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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 27 [2021-11-19 14:10:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:10:12,308 INFO L225 Difference]: With dead ends: 387 [2021-11-19 14:10:12,308 INFO L226 Difference]: Without dead ends: 384 [2021-11-19 14:10:12,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=287, Invalid=583, Unknown=0, NotChecked=0, Total=870 [2021-11-19 14:10:12,309 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 107 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:10:12,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 17 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 401 Invalid, 0 Unknown, 53 Unchecked, 1.3s Time] [2021-11-19 14:10:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-19 14:10:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 266. [2021-11-19 14:10:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.7604562737642586) internal successors, (463), 265 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:10:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 463 transitions. [2021-11-19 14:10:12,319 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 463 transitions. Word has length 27 [2021-11-19 14:10:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:10:12,320 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 463 transitions. [2021-11-19 14:10:12,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:10:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 463 transitions. [2021-11-19 14:10:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 14:10:12,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:10:12,321 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:10:12,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-11-19 14:10:12,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:10:12,521 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:10:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:10:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1194372704, now seen corresponding path program 1 times [2021-11-19 14:10:12,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:10:12,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380038509] [2021-11-19 14:10:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:10:12,523 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:10:12,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:10:12,524 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:10:12,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-19 14:10:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:10:12,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 14:10:12,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:10:12,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:10:12,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:10:12,770 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:10:12,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:10:12,841 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:10:12,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-11-19 14:10:13,024 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:10:13,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2021-11-19 14:10:13,136 INFO L354 Elim1Store]: treesize reduction 50, result has 16.7 percent of original size [2021-11-19 14:10:13,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 70 [2021-11-19 14:10:13,313 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-11-19 14:10:13,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 96 [2021-11-19 14:10:13,551 INFO L354 Elim1Store]: treesize reduction 127, result has 21.6 percent of original size [2021-11-19 14:10:13,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 128 [2021-11-19 14:10:14,003 INFO L354 Elim1Store]: treesize reduction 457, result has 15.1 percent of original size [2021-11-19 14:10:14,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 case distinctions, treesize of input 141 treesize of output 179 [2021-11-19 14:10:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:10:14,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:10:38,804 WARN L227 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:10:46,811 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse5 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 t_funThread1of1ForFork0_~p~0.base (store (select .cse3 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))))))) is different from false [2021-11-19 14:10:48,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))))))))) is different from false [2021-11-19 14:10:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:10:48,999 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:10:48,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380038509] [2021-11-19 14:10:48,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380038509] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:10:48,999 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:10:48,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 20 [2021-11-19 14:10:48,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070113948] [2021-11-19 14:10:49,000 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:10:49,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 14:10:49,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:10:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 14:10:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=243, Unknown=6, NotChecked=70, Total=420 [2021-11-19 14:10:49,001 INFO L87 Difference]: Start difference. First operand 266 states and 463 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:10:51,405 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|)) (= (_ bv0 1) (select (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))))))))) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|))) is different from false [2021-11-19 14:10:53,458 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|))) (and (= (_ bv0 1) (bvneg (select .cse0 (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse3 t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse3 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse2 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse1 t_funThread1of1ForFork0_~p~0.base (store (select .cse1 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))))))) (= (_ bv0 1) (select .cse0 |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|)) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse6 t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse6 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 t_funThread1of1ForFork0_~p~0.base (store (select .cse4 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))))) is different from false [2021-11-19 14:10:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:10:53,948 INFO L93 Difference]: Finished difference Result 332 states and 564 transitions. [2021-11-19 14:10:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-19 14:10:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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 [2021-11-19 14:10:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:10:53,951 INFO L225 Difference]: With dead ends: 332 [2021-11-19 14:10:53,951 INFO L226 Difference]: Without dead ends: 332 [2021-11-19 14:10:53,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=109, Invalid=279, Unknown=8, NotChecked=156, Total=552 [2021-11-19 14:10:53,952 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 14:10:53,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 29 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 258 Unchecked, 0.8s Time] [2021-11-19 14:10:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-19 14:10:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 268. [2021-11-19 14:10:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 265 states have (on average 1.7547169811320755) internal successors, (465), 267 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:10:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 465 transitions. [2021-11-19 14:10:53,958 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 465 transitions. Word has length 28 [2021-11-19 14:10:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:10:53,959 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 465 transitions. [2021-11-19 14:10:53,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:10:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 465 transitions. [2021-11-19 14:10:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 14:10:53,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:10:53,960 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:10:53,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-11-19 14:10:54,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:10:54,174 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:10:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:10:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1196188994, now seen corresponding path program 2 times [2021-11-19 14:10:54,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:10:54,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332446789] [2021-11-19 14:10:54,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 14:10:54,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:10:54,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:10:54,178 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:10:54,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-19 14:10:54,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:10:54,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:10:54,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 14:10:54,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:10:54,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2021-11-19 14:10:54,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:10:54,368 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:10:54,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:10:54,425 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:10:54,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-19 14:10:54,577 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:10:54,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2021-11-19 14:10:54,682 INFO L354 Elim1Store]: treesize reduction 50, result has 16.7 percent of original size [2021-11-19 14:10:54,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 77 [2021-11-19 14:10:54,839 INFO L354 Elim1Store]: treesize reduction 105, result has 25.0 percent of original size [2021-11-19 14:10:54,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 120 [2021-11-19 14:10:55,065 INFO L354 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2021-11-19 14:10:55,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 143 treesize of output 163 [2021-11-19 14:10:55,496 INFO L354 Elim1Store]: treesize reduction 457, result has 15.1 percent of original size [2021-11-19 14:10:55,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 case distinctions, treesize of input 178 treesize of output 216 [2021-11-19 14:10:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:10:55,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:11:19,111 WARN L227 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:11:37,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse5 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse3 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))))) is different from false [2021-11-19 14:11:39,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))) is different from false [2021-11-19 14:11:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:11:39,661 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:11:39,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332446789] [2021-11-19 14:11:39,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332446789] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:11:39,662 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:11:39,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 20 [2021-11-19 14:11:39,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492681556] [2021-11-19 14:11:39,662 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:11:39,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 14:11:39,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:11:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 14:11:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=247, Unknown=5, NotChecked=70, Total=420 [2021-11-19 14:11:39,663 INFO L87 Difference]: Start difference. First operand 268 states and 465 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:11:42,065 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|)) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))) (= (_ bv0 1) (select (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|))) is different from false [2021-11-19 14:11:44,109 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|))) (and (= (_ bv0 1) (bvneg (select .cse0 (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse3 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse3 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse2 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse1 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse1 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread1of1ForFork0_~p~0.base (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse6 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse6 t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 t_funThread1of1ForFork0_~p~0.base (store (store (select .cse4 t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))) (= (_ bv0 1) (select .cse0 |c_ULTIMATE.start_main_~#id~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#id~0#1.base| |c_t_funThread1of1ForFork0_#in~arg.base|)))) is different from false [2021-11-19 14:11:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:11:44,969 INFO L93 Difference]: Finished difference Result 345 states and 584 transitions. [2021-11-19 14:11:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-19 14:11:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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 [2021-11-19 14:11:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:11:44,973 INFO L225 Difference]: With dead ends: 345 [2021-11-19 14:11:44,973 INFO L226 Difference]: Without dead ends: 345 [2021-11-19 14:11:44,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=106, Invalid=283, Unknown=7, NotChecked=156, Total=552 [2021-11-19 14:11:44,974 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:11:44,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 280 Invalid, 0 Unknown, 323 Unchecked, 1.2s Time] [2021-11-19 14:11:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-19 14:11:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 269. [2021-11-19 14:11:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 266 states have (on average 1.7518796992481203) internal successors, (466), 268 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:11:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 466 transitions. [2021-11-19 14:11:44,980 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 466 transitions. Word has length 28 [2021-11-19 14:11:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:11:44,981 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 466 transitions. [2021-11-19 14:11:44,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:11:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 466 transitions. [2021-11-19 14:11:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 14:11:44,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:11:44,982 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:11:45,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-11-19 14:11:45,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:11:45,195 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:11:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:11:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1251600254, now seen corresponding path program 3 times [2021-11-19 14:11:45,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:11:45,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703895310] [2021-11-19 14:11:45,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:11:45,196 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:11:45,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:11:45,197 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:11:45,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-19 14:11:45,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:11:45,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:11:45,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 14:11:45,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:11:45,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:11:45,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:11:45,380 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:11:45,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:11:45,437 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-19 14:11:45,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-19 14:11:45,611 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:11:45,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2021-11-19 14:11:45,735 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-19 14:11:45,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 90 [2021-11-19 14:11:45,891 INFO L354 Elim1Store]: treesize reduction 84, result has 10.6 percent of original size [2021-11-19 14:11:45,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 105 treesize of output 119 [2021-11-19 14:11:46,110 INFO L354 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2021-11-19 14:11:46,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 151 [2021-11-19 14:11:46,524 INFO L354 Elim1Store]: treesize reduction 457, result has 15.1 percent of original size [2021-11-19 14:11:46,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 case distinctions, treesize of input 176 treesize of output 214 [2021-11-19 14:11:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:11:47,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:11:49,963 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))) (_ bv0 1)))) is different from false [2021-11-19 14:11:52,156 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 c_t_funThread1of1ForFork0_~p~0.base (store (store (store (select .cse4 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))))))) is different from false [2021-11-19 14:11:54,594 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (store (select .cse4 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))) is different from false [2021-11-19 14:11:56,658 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse5 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse5 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse4 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse3 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (store (select .cse3 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))) is different from false [2021-11-19 14:11:58,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|)))))))))))) is different from false [2021-11-19 14:11:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:11:58,793 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:11:58,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703895310] [2021-11-19 14:11:58,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703895310] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:11:58,793 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:11:58,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 22 [2021-11-19 14:11:58,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228823494] [2021-11-19 14:11:58,793 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:11:58,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-19 14:11:58,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:11:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-19 14:11:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=229, Unknown=5, NotChecked=180, Total=506 [2021-11-19 14:11:58,794 INFO L87 Difference]: Start difference. First operand 269 states and 466 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:12:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:12:16,169 INFO L93 Difference]: Finished difference Result 367 states and 607 transitions. [2021-11-19 14:12:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-19 14:12:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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 [2021-11-19 14:12:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:12:16,172 INFO L225 Difference]: With dead ends: 367 [2021-11-19 14:12:16,172 INFO L226 Difference]: Without dead ends: 367 [2021-11-19 14:12:16,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=137, Invalid=430, Unknown=5, NotChecked=240, Total=812 [2021-11-19 14:12:16,172 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:12:16,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 27 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 320 Invalid, 0 Unknown, 479 Unchecked, 1.4s Time] [2021-11-19 14:12:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-19 14:12:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 272. [2021-11-19 14:12:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 269 states have (on average 1.7472118959107807) internal successors, (470), 271 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:12:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 470 transitions. [2021-11-19 14:12:16,191 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 470 transitions. Word has length 28 [2021-11-19 14:12:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:12:16,191 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 470 transitions. [2021-11-19 14:12:16,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:12:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 470 transitions. [2021-11-19 14:12:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 14:12:16,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:12:16,192 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:12:16,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-11-19 14:12:16,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:12:16,406 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:12:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:12:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1197792142, now seen corresponding path program 4 times [2021-11-19 14:12:16,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:12:16,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827219100] [2021-11-19 14:12:16,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:12:16,407 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:12:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:12:16,408 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:12:16,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-19 14:12:16,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:12:16,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:12:16,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 14:12:16,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:12:16,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-19 14:12:16,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:12:16,598 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:12:16,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:12:16,671 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 14:12:16,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2021-11-19 14:12:16,727 INFO L354 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2021-11-19 14:12:16,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 49 [2021-11-19 14:12:16,836 INFO L354 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2021-11-19 14:12:16,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 81 [2021-11-19 14:12:16,973 INFO L354 Elim1Store]: treesize reduction 82, result has 21.9 percent of original size [2021-11-19 14:12:16,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 113 [2021-11-19 14:12:17,228 INFO L354 Elim1Store]: treesize reduction 127, result has 21.6 percent of original size [2021-11-19 14:12:17,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 152 [2021-11-19 14:12:17,738 INFO L354 Elim1Store]: treesize reduction 457, result has 15.1 percent of original size [2021-11-19 14:12:17,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 case distinctions, treesize of input 179 treesize of output 217 [2021-11-19 14:12:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:12:18,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:12:34,810 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:12:36,887 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)))))))))))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse7 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse6 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse6 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse5 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse4 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse4 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))) is different from false [2021-11-19 14:12:38,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32)) (_ bv0 1))))) (store .cse4 |c_t_funThread1of1ForFork0_#in~arg.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_#in~arg.base|) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1)))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse2 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 |c_t_funThread1of1ForFork0_#in~arg.base| (store (select .cse0 |c_t_funThread1of1ForFork0_#in~arg.base|) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))))) is different from false [2021-11-19 14:12:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:12:38,980 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:12:38,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827219100] [2021-11-19 14:12:38,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827219100] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:12:38,980 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:12:38,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 21 [2021-11-19 14:12:38,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871743041] [2021-11-19 14:12:38,980 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:12:38,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-19 14:12:38,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:12:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-19 14:12:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=272, Unknown=3, NotChecked=74, Total=462 [2021-11-19 14:12:38,981 INFO L87 Difference]: Start difference. First operand 272 states and 470 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:12:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:12:50,401 INFO L93 Difference]: Finished difference Result 391 states and 636 transitions. [2021-11-19 14:12:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-19 14:12:50,402 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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 [2021-11-19 14:12:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:12:50,404 INFO L225 Difference]: With dead ends: 391 [2021-11-19 14:12:50,404 INFO L226 Difference]: Without dead ends: 391 [2021-11-19 14:12:50,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=392, Invalid=944, Unknown=4, NotChecked=142, Total=1482 [2021-11-19 14:12:50,405 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:12:50,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 9 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 378 Invalid, 0 Unknown, 398 Unchecked, 1.3s Time] [2021-11-19 14:12:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-11-19 14:12:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 274. [2021-11-19 14:12:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 271 states have (on average 1.7490774907749078) internal successors, (474), 273 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:12:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 474 transitions. [2021-11-19 14:12:50,412 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 474 transitions. Word has length 28 [2021-11-19 14:12:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:12:50,412 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 474 transitions. [2021-11-19 14:12:50,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:12:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 474 transitions. [2021-11-19 14:12:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 14:12:50,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:12:50,413 INFO L514 BasicCegarLoop]: 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] [2021-11-19 14:12:50,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-11-19 14:12:50,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:12:50,616 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2021-11-19 14:12:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:12:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1199608432, now seen corresponding path program 5 times [2021-11-19 14:12:50,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:12:50,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91838792] [2021-11-19 14:12:50,617 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-19 14:12:50,617 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:12:50,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:12:50,617 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:12:50,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a163b116-dd47-4399-998e-9d5bbb3d945d/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-11-19 14:12:50,727 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-19 14:12:50,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:12:50,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 14:12:50,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:12:50,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2021-11-19 14:12:50,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:12:50,847 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-19 14:12:50,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-19 14:12:50,936 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 14:12:50,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2021-11-19 14:12:50,991 INFO L354 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2021-11-19 14:12:50,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 45 treesize of output 53 [2021-11-19 14:12:51,098 INFO L354 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2021-11-19 14:12:51,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 81 [2021-11-19 14:12:51,262 INFO L354 Elim1Store]: treesize reduction 105, result has 25.0 percent of original size [2021-11-19 14:12:51,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 122 [2021-11-19 14:12:51,502 INFO L354 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2021-11-19 14:12:51,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 142 treesize of output 162 [2021-11-19 14:12:51,948 INFO L354 Elim1Store]: treesize reduction 457, result has 15.1 percent of original size [2021-11-19 14:12:51,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 case distinctions, treesize of input 184 treesize of output 222 [2021-11-19 14:12:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 14:12:52,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:12:56,454 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse1 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse0 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse0 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) |c_ULTIMATE.start_main_~#id~0#1.offset|))))))))) (forall ((t_funThread1of1ForFork0_~p~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) t_funThread1of1ForFork0_~p~0.offset (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv1 32)) (_ bv0 1))))) (store .cse3 |c_ULTIMATE.start_main_~#id~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#id~0#1.offset|) (_ bv0 1)))))) (store .cse2 c_t_funThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_t_funThread1of1ForFork0_~p~0.base) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd t_funThread1of1ForFork0_~p~0.offset (_ bv3 32)) (_ bv0 1)))) |c_ULTIMATE.start_main_~#id~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#id~0#1.offset| (_ bv1 32))))))))))))) is different from false [2021-11-19 14:13:16,079 WARN L227 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)