./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI --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 e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:41:10,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:41:10,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:41:10,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:41:10,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:41:10,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:41:10,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:41:10,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:41:10,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:41:10,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:41:10,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:41:10,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:41:10,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:41:10,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:41:10,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:41:10,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:41:10,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:41:10,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:41:10,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:41:10,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:41:10,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:41:10,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:41:10,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:41:10,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:41:10,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:41:10,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:41:10,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:41:10,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:41:10,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:41:10,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:41:10,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:41:10,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:41:10,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:41:10,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:41:10,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:41:10,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:41:10,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:41:10,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:41:10,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:41:10,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:41:10,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:41:10,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 03:41:10,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:41:10,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:41:10,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:41:10,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:41:10,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:41:10,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:41:10,754 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:41:10,754 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:41:10,754 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:41:10,755 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:41:10,755 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:41:10,755 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:41:10,755 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:41:10,756 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:41:10,756 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:41:10,756 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:41:10,756 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:41:10,756 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:41:10,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:41:10,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:41:10,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:41:10,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:41:10,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:41:10,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:41:10,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:41:10,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:41:10,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:41:10,759 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 03:41:10,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:41:10,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:41:10,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:41:10,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:41:10,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:41:10,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:41:10,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:41:10,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:41:10,760 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:41:10,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:41:10,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:41:10,761 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:41:10,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:41:10,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:41:10,761 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:41:10,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/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_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI 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 -> e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd [2022-11-03 03:41:11,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:41:11,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:41:11,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:41:11,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:41:11,076 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:41:11,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2022-11-03 03:41:11,164 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/data/c2355b9e3/752281f0b13f42efa97d357155d39e1b/FLAG42f95dda5 [2022-11-03 03:41:11,812 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:41:11,812 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2022-11-03 03:41:11,827 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/data/c2355b9e3/752281f0b13f42efa97d357155d39e1b/FLAG42f95dda5 [2022-11-03 03:41:12,059 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/data/c2355b9e3/752281f0b13f42efa97d357155d39e1b [2022-11-03 03:41:12,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:41:12,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:41:12,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:41:12,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:41:12,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:41:12,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:12,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77528ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12, skipping insertion in model container [2022-11-03 03:41:12,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:12,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:41:12,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:41:12,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:41:12,762 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:41:12,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:41:12,904 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:41:12,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12 WrapperNode [2022-11-03 03:41:12,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:41:12,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:41:12,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:41:12,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:41:12,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:12,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:12,987 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-11-03 03:41:12,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:41:12,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:41:12,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:41:12,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:41:12,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,049 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:41:13,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:41:13,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:41:13,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:41:13,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (1/1) ... [2022-11-03 03:41:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:41:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:13,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:41:13,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:41:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:41:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:41:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:41:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:41:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 03:41:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:41:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-03 03:41:13,155 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-03 03:41:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:41:13,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:41:13,157 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:41:13,319 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:41:13,321 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:41:13,624 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:41:13,632 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:41:13,637 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:41:13,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:41:13 BoogieIcfgContainer [2022-11-03 03:41:13,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:41:13,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:41:13,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:41:13,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:41:13,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:41:12" (1/3) ... [2022-11-03 03:41:13,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505d2c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:41:13, skipping insertion in model container [2022-11-03 03:41:13,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:41:12" (2/3) ... [2022-11-03 03:41:13,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505d2c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:41:13, skipping insertion in model container [2022-11-03 03:41:13,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:41:13" (3/3) ... [2022-11-03 03:41:13,656 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.i [2022-11-03 03:41:13,668 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:41:13,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:41:13,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-03 03:41:13,681 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:41:13,776 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:41:13,833 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:41:13,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 106 transitions, 217 flow [2022-11-03 03:41:13,866 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 106 transitions, 217 flow [2022-11-03 03:41:13,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 106 transitions, 217 flow [2022-11-03 03:41:13,977 INFO L130 PetriNetUnfolder]: 4/105 cut-off events. [2022-11-03 03:41:13,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 03:41:13,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 4/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-11-03 03:41:13,994 INFO L118 LiptonReduction]: Number of co-enabled transitions 2400 [2022-11-03 03:41:16,978 INFO L133 LiptonReduction]: Checked pairs total: 13280 [2022-11-03 03:41:16,978 INFO L135 LiptonReduction]: Total number of compositions: 82 [2022-11-03 03:41:16,988 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 81 flow [2022-11-03 03:41:17,024 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 288 states, 280 states have (on average 1.9892857142857143) internal successors, (557), 287 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:41:17,063 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b85ffad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:41:17,064 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 03:41:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 280 states have (on average 1.9892857142857143) internal successors, (557), 287 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:41:17,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:17,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:41:17,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash 359669258, now seen corresponding path program 1 times [2022-11-03 03:41:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:17,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345886974] [2022-11-03 03:41:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:17,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:17,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345886974] [2022-11-03 03:41:17,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345886974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:17,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:17,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:41:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590010397] [2022-11-03 03:41:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:17,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:41:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:17,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:41:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:41:17,394 INFO L87 Difference]: Start difference. First operand has 288 states, 280 states have (on average 1.9892857142857143) internal successors, (557), 287 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:17,488 INFO L93 Difference]: Finished difference Result 289 states and 541 transitions. [2022-11-03 03:41:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:41:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:41:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:17,503 INFO L225 Difference]: With dead ends: 289 [2022-11-03 03:41:17,503 INFO L226 Difference]: Without dead ends: 289 [2022-11-03 03:41:17,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:41:17,508 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:17,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:41:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-03 03:41:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-11-03 03:41:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 281 states have (on average 1.9252669039145907) internal successors, (541), 288 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 541 transitions. [2022-11-03 03:41:17,580 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 541 transitions. Word has length 5 [2022-11-03 03:41:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:17,581 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 541 transitions. [2022-11-03 03:41:17,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 541 transitions. [2022-11-03 03:41:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:41:17,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:17,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:17,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:41:17,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1707305553, now seen corresponding path program 1 times [2022-11-03 03:41:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:17,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251912461] [2022-11-03 03:41:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:17,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:17,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251912461] [2022-11-03 03:41:17,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251912461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:17,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913241897] [2022-11-03 03:41:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:17,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:17,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:41:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:17,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:41:17,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:17,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:17,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913241897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807290245] [2022-11-03 03:41:17,903 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:41:17,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:17,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 03:41:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922410947] [2022-11-03 03:41:17,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:17,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:41:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:41:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:41:17,909 INFO L87 Difference]: Start difference. First operand 289 states and 541 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:17,954 INFO L93 Difference]: Finished difference Result 292 states and 544 transitions. [2022-11-03 03:41:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:41:17,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:41:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:17,957 INFO L225 Difference]: With dead ends: 292 [2022-11-03 03:41:17,957 INFO L226 Difference]: Without dead ends: 292 [2022-11-03 03:41:17,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:41:17,959 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:17,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:41:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-03 03:41:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-03 03:41:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 284 states have (on average 1.9154929577464788) internal successors, (544), 291 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 544 transitions. [2022-11-03 03:41:17,974 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 544 transitions. Word has length 11 [2022-11-03 03:41:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:17,974 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 544 transitions. [2022-11-03 03:41:17,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 544 transitions. [2022-11-03 03:41:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:41:17,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:17,975 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:18,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:18,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:18,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1584261996, now seen corresponding path program 2 times [2022-11-03 03:41:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:18,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850127392] [2022-11-03 03:41:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 03:41:18,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:18,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850127392] [2022-11-03 03:41:18,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850127392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:18,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:18,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:41:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585019365] [2022-11-03 03:41:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:41:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:41:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:18,780 INFO L87 Difference]: Start difference. First operand 292 states and 544 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:19,245 INFO L93 Difference]: Finished difference Result 401 states and 741 transitions. [2022-11-03 03:41:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:41:19,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 03:41:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:19,249 INFO L225 Difference]: With dead ends: 401 [2022-11-03 03:41:19,250 INFO L226 Difference]: Without dead ends: 401 [2022-11-03 03:41:19,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:19,251 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:19,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 18 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:41:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-11-03 03:41:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 310. [2022-11-03 03:41:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 303 states have (on average 1.900990099009901) internal successors, (576), 309 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 576 transitions. [2022-11-03 03:41:19,265 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 576 transitions. Word has length 14 [2022-11-03 03:41:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:19,265 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 576 transitions. [2022-11-03 03:41:19,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 576 transitions. [2022-11-03 03:41:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:41:19,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:19,267 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:19,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:41:19,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -407774408, now seen corresponding path program 1 times [2022-11-03 03:41:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:19,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205954404] [2022-11-03 03:41:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 03:41:19,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:19,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205954404] [2022-11-03 03:41:19,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205954404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:19,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:19,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:41:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472432453] [2022-11-03 03:41:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:41:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:41:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:19,528 INFO L87 Difference]: Start difference. First operand 310 states and 576 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:19,909 INFO L93 Difference]: Finished difference Result 420 states and 775 transitions. [2022-11-03 03:41:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:41:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 03:41:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:19,913 INFO L225 Difference]: With dead ends: 420 [2022-11-03 03:41:19,914 INFO L226 Difference]: Without dead ends: 420 [2022-11-03 03:41:19,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:19,916 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:19,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:41:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-03 03:41:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 329. [2022-11-03 03:41:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 322 states have (on average 1.8944099378881987) internal successors, (610), 328 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 610 transitions. [2022-11-03 03:41:19,931 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 610 transitions. Word has length 14 [2022-11-03 03:41:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:19,931 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 610 transitions. [2022-11-03 03:41:19,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 610 transitions. [2022-11-03 03:41:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:41:19,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:19,934 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:41:19,934 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1253807707, now seen corresponding path program 1 times [2022-11-03 03:41:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:19,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289227425] [2022-11-03 03:41:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:20,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:20,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289227425] [2022-11-03 03:41:20,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289227425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:20,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141986413] [2022-11-03 03:41:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:20,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:20,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:41:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:20,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:41:20,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:20,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:41:20,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141986413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1850124858] [2022-11-03 03:41:20,317 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:41:20,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:20,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-03 03:41:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176184820] [2022-11-03 03:41:20,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:41:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:41:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:41:20,338 INFO L87 Difference]: Start difference. First operand 329 states and 610 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:20,415 INFO L93 Difference]: Finished difference Result 335 states and 616 transitions. [2022-11-03 03:41:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:41:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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 20 [2022-11-03 03:41:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:20,428 INFO L225 Difference]: With dead ends: 335 [2022-11-03 03:41:20,428 INFO L226 Difference]: Without dead ends: 335 [2022-11-03 03:41:20,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:41:20,430 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:20,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:41:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-03 03:41:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2022-11-03 03:41:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 328 states have (on average 1.8780487804878048) internal successors, (616), 334 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 616 transitions. [2022-11-03 03:41:20,456 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 616 transitions. Word has length 20 [2022-11-03 03:41:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:20,457 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 616 transitions. [2022-11-03 03:41:20,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 616 transitions. [2022-11-03 03:41:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:41:20,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:20,459 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:20,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:20,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:20,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1871764165, now seen corresponding path program 2 times [2022-11-03 03:41:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:20,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524974312] [2022-11-03 03:41:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:41:21,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:21,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524974312] [2022-11-03 03:41:21,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524974312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:21,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:21,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:41:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017410445] [2022-11-03 03:41:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:41:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:21,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:41:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:21,203 INFO L87 Difference]: Start difference. First operand 335 states and 616 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:21,548 INFO L93 Difference]: Finished difference Result 514 states and 949 transitions. [2022-11-03 03:41:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:41:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:41:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:21,552 INFO L225 Difference]: With dead ends: 514 [2022-11-03 03:41:21,552 INFO L226 Difference]: Without dead ends: 488 [2022-11-03 03:41:21,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:21,554 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:21,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 17 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:41:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-03 03:41:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 353. [2022-11-03 03:41:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 346 states have (on average 1.8670520231213872) internal successors, (646), 352 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 646 transitions. [2022-11-03 03:41:21,566 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 646 transitions. Word has length 26 [2022-11-03 03:41:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:21,566 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 646 transitions. [2022-11-03 03:41:21,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 646 transitions. [2022-11-03 03:41:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:41:21,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:21,568 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:21,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:41:21,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash 530921540, now seen corresponding path program 1 times [2022-11-03 03:41:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:21,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075807343] [2022-11-03 03:41:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:41:22,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:22,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075807343] [2022-11-03 03:41:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075807343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:41:22,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:41:22,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:41:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482642649] [2022-11-03 03:41:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:41:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:41:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:22,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:41:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:22,014 INFO L87 Difference]: Start difference. First operand 353 states and 646 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:22,399 INFO L93 Difference]: Finished difference Result 500 states and 905 transitions. [2022-11-03 03:41:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:41:22,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:41:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:22,403 INFO L225 Difference]: With dead ends: 500 [2022-11-03 03:41:22,403 INFO L226 Difference]: Without dead ends: 474 [2022-11-03 03:41:22,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:41:22,404 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:22,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 18 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:41:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-03 03:41:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 362. [2022-11-03 03:41:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 355 states have (on average 1.8422535211267606) internal successors, (654), 361 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 654 transitions. [2022-11-03 03:41:22,422 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 654 transitions. Word has length 26 [2022-11-03 03:41:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:22,423 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 654 transitions. [2022-11-03 03:41:22,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 654 transitions. [2022-11-03 03:41:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:41:22,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:22,430 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:22,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:41:22,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:41:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash -459315775, now seen corresponding path program 1 times [2022-11-03 03:41:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:22,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184806928] [2022-11-03 03:41:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:41:22,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:41:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:41:22,527 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:41:22,528 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:41:22,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2022-11-03 03:41:22,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2022-11-03 03:41:22,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2022-11-03 03:41:22,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-03 03:41:22,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2022-11-03 03:41:22,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2022-11-03 03:41:22,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2022-11-03 03:41:22,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:41:22,535 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-11-03 03:41:22,541 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 03:41:22,542 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:41:22,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:41:22 BasicIcfg [2022-11-03 03:41:22,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:41:22,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:41:22,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:41:22,589 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:41:22,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:41:13" (3/4) ... [2022-11-03 03:41:22,593 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 03:41:22,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:41:22,594 INFO L158 Benchmark]: Toolchain (without parser) took 10530.06ms. Allocated memory was 115.3MB in the beginning and 174.1MB in the end (delta: 58.7MB). Free memory was 80.8MB in the beginning and 89.2MB in the end (delta: -8.4MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-11-03 03:41:22,595 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 79.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:41:22,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 836.84ms. Allocated memory is still 115.3MB. Free memory was 80.5MB in the beginning and 73.2MB in the end (delta: 7.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 03:41:22,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.23ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 70.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:41:22,596 INFO L158 Benchmark]: Boogie Preprocessor took 64.75ms. Allocated memory is still 115.3MB. Free memory was 70.5MB in the beginning and 69.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:41:22,597 INFO L158 Benchmark]: RCFGBuilder took 587.21ms. Allocated memory is still 115.3MB. Free memory was 69.0MB in the beginning and 52.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-03 03:41:22,597 INFO L158 Benchmark]: TraceAbstraction took 8945.22ms. Allocated memory was 115.3MB in the beginning and 174.1MB in the end (delta: 58.7MB). Free memory was 51.6MB in the beginning and 89.2MB in the end (delta: -37.6MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-11-03 03:41:22,598 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 174.1MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:41:22,600 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.93ms. Allocated memory is still 79.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 836.84ms. Allocated memory is still 115.3MB. Free memory was 80.5MB in the beginning and 73.2MB in the end (delta: 7.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.23ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 70.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.75ms. Allocated memory is still 115.3MB. Free memory was 70.5MB in the beginning and 69.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 587.21ms. Allocated memory is still 115.3MB. Free memory was 69.0MB in the beginning and 52.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8945.22ms. Allocated memory was 115.3MB in the beginning and 174.1MB in the end (delta: 58.7MB). Free memory was 51.6MB in the beginning and 89.2MB in the end (delta: -37.6MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 174.1MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 106 PlacesBefore, 40 PlacesAfterwards, 106 TransitionsBefore, 38 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 10 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 13280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3633, positive: 3016, positive conditional: 0, positive unconditional: 3016, negative: 617, negative conditional: 0, negative unconditional: 617, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1530, positive: 1466, positive conditional: 0, positive unconditional: 1466, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1530, positive: 1378, positive conditional: 0, positive unconditional: 1378, negative: 152, negative conditional: 0, negative unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 152, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 464, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 253, negative conditional: 0, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3633, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 553, negative conditional: 0, negative unconditional: 553, unknown: 1530, unknown conditional: 0, unknown unconditional: 1530] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 932]: Data race detected Data race detected The following path leads to a data race: [L922-L925] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; [L937] 0 int i = 0; VAL [a={1:0}, i=0] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=1] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=2] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=3] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=4] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=5] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=6] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=7] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=8] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=9] [L937] COND TRUE 0 i < 10 [L937] 0 i++ VAL [a={1:0}, i=10] [L937] COND FALSE 0 !(i < 10) [L939] 0 int i = __VERIFIER_nondet_int(); [L940] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) [L940] RET 0 assume_abort_if_not(0 <= i && i < 10) [L941] 0 pthread_t t1; [L942] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [a={1:0}, i=9, i=10, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={2:0}] [L927] 1 int i = __VERIFIER_nondet_int(); [L928] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L11] COND FALSE 1 !(!cond) [L928] RET 1 assume_abort_if_not(0 <= i && i < 9) [L929] 1 struct s *p = &a[i]; [L931] 1 i++ [L932] EXPR 1 a[i].datum VAL [a={1:0}, a[i].datum=0, arg={0:0}, arg={0:0}, i=9, p={1:224}] [L932] 1 a[i].datum++ VAL [a={1:0}, a[i].datum=0, arg={0:0}, arg={0:0}, i=9, p={1:224}] [L932] 1 a[i].datum++ VAL [a={1:0}, a[i].datum=0, a[i].datum++=0, a[i].datum++=281, arg={0:0}, arg={0:0}, i=9, p={1:224}] [L944] EXPR 0 a[i].datum VAL [a={1:0}, a[i].datum=1, i=9, i=10, t1={2:0}] [L944] 0 a[i].datum++ VAL [a={1:0}, a[i].datum=1, i=10, i=9, t1={2:0}] [L932] 1 a[i].datum++ VAL [a={1:0}, a[i].datum=0, a[i].datum++=0, a[i].datum++=281, arg={0:0}, arg={0:0}, i=9, p={1:224}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: a[i].datum++ [932] * C: a[i].datum++ [932] * C: a[i].datum++ [932] * C: a[i].datum++ [932] * C: a[i].datum++ [944] and C: a[i].datum++ [932] - UnprovableResult [Line: 944]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 944]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 144 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 137 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 429 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 130/163 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-03 03:41:22,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c13ad1d3-ec92-47db-abee-5b551d7a365d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE