./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 38b53e6a 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_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur --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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- 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-38b53e6 [2022-11-25 23:46:42,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:46:42,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:46:42,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:46:42,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:46:42,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:46:42,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:46:42,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:46:42,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:46:42,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:46:42,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:46:42,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:46:42,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:46:42,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:46:42,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:46:42,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:46:42,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:46:42,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:46:42,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:46:42,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:46:42,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:46:42,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:46:42,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:46:42,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:46:42,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:46:42,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:46:42,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:46:42,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:46:42,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:46:42,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:46:42,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:46:42,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:46:42,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:46:42,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:46:42,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:46:42,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:46:42,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:46:42,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:46:42,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:46:42,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:46:42,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:46:42,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-25 23:46:42,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:46:42,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:46:42,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:46:42,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:46:42,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:46:42,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:46:42,975 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:46:42,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:46:42,976 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:46:42,976 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:46:42,976 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:46:42,976 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:46:42,976 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:46:42,977 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:46:42,977 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:46:42,977 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:46:42,977 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:46:42,978 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:46:42,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:46:42,978 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:46:42,979 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:46:42,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:46:42,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:46:42,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:46:42,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:46:42,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:46:42,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:46:42,980 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-25 23:46:42,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:46:42,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:46:42,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:46:42,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:46:42,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:46:42,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:46:42,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:46:42,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:46:42,982 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:46:42,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:46:42,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:46:42,983 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:46:42,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:46:42,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:46:42,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:46:42,984 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_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/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_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2022-11-25 23:46:43,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:46:43,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:46:43,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:46:43,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:46:43,287 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:46:43,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2022-11-25 23:46:46,514 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:46:46,826 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:46:46,827 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2022-11-25 23:46:46,848 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/data/1e8f49ed2/5916a742b79045dbb4c6a7e26b383018/FLAG75a635625 [2022-11-25 23:46:46,862 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/data/1e8f49ed2/5916a742b79045dbb4c6a7e26b383018 [2022-11-25 23:46:46,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:46:46,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:46:46,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:46:46,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:46:46,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:46:46,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:46:46" (1/1) ... [2022-11-25 23:46:46,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396be1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:46, skipping insertion in model container [2022-11-25 23:46:46,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:46:46" (1/1) ... [2022-11-25 23:46:46,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:46:46,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:46:47,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:46:47,538 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:46:47,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:46:47,714 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:46:47,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47 WrapperNode [2022-11-25 23:46:47,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:46:47,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:46:47,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:46:47,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:46:47,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,778 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2022-11-25 23:46:47,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:46:47,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:46:47,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:46:47,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:46:47,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,844 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:46:47,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:46:47,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:46:47,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:46:47,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (1/1) ... [2022-11-25 23:46:47,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:46:47,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:47,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:46:47,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:46:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:46:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:46:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:46:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:46:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:46:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 23:46:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:46:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:46:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:46:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-25 23:46:48,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-25 23:46:48,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:46:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:46:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:46:48,040 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:46:48,197 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:46:48,199 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:46:49,064 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:46:49,077 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:46:49,078 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:46:49,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:49 BoogieIcfgContainer [2022-11-25 23:46:49,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:46:49,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:46:49,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:46:49,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:46:49,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:46:46" (1/3) ... [2022-11-25 23:46:49,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c04346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:46:49, skipping insertion in model container [2022-11-25 23:46:49,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:47" (2/3) ... [2022-11-25 23:46:49,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c04346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:46:49, skipping insertion in model container [2022-11-25 23:46:49,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:49" (3/3) ... [2022-11-25 23:46:49,092 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-11-25 23:46:49,102 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:46:49,114 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:46:49,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-25 23:46:49,115 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:46:49,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:46:49,256 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:46:49,287 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 276 transitions, 557 flow [2022-11-25 23:46:49,297 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 276 transitions, 557 flow [2022-11-25 23:46:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 557 flow [2022-11-25 23:46:49,521 INFO L130 PetriNetUnfolder]: 0/275 cut-off events. [2022-11-25 23:46:49,527 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 23:46:49,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-11-25 23:46:49,544 INFO L119 LiptonReduction]: Number of co-enabled transitions 7728 [2022-11-25 23:47:30,284 WARN L233 SmtUtils]: Spent 13.23s on a formula simplification. DAG size of input: 139 DAG size of output: 137 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:47:45,314 WARN L233 SmtUtils]: Spent 11.30s on a formula simplification. DAG size of input: 139 DAG size of output: 137 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:47:56,304 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:48:01,653 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:48:07,673 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:48:32,302 WARN L233 SmtUtils]: Spent 20.24s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:48:51,409 WARN L233 SmtUtils]: Spent 19.10s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:49:02,676 WARN L233 SmtUtils]: Spent 11.26s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:49:23,696 WARN L233 SmtUtils]: Spent 21.02s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:49:37,766 WARN L233 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:49:52,441 WARN L233 SmtUtils]: Spent 14.67s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:50:13,476 WARN L233 SmtUtils]: Spent 21.03s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:50:28,049 WARN L233 SmtUtils]: Spent 14.57s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:54:00,348 WARN L233 SmtUtils]: Spent 3.54m on a formula simplification that was a NOOP. DAG size: 370 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:55:55,569 WARN L233 SmtUtils]: Spent 1.92m on a formula simplification that was a NOOP. DAG size: 329 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:58:00,796 WARN L233 SmtUtils]: Spent 2.09m on a formula simplification that was a NOOP. DAG size: 370 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:59:30,797 WARN L233 SmtUtils]: Spent 1.50m on a formula simplification that was a NOOP. DAG size: 329 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:59:31,182 INFO L134 LiptonReduction]: Checked pairs total: 102063 [2022-11-25 23:59:31,183 INFO L136 LiptonReduction]: Total number of compositions: 288 [2022-11-25 23:59:31,191 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 91 transitions, 187 flow [2022-11-25 23:59:31,278 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1447 states, 1371 states have (on average 2.0437636761487963) internal successors, (2802), 1446 states have internal predecessors, (2802), 0 states have call successors, (0), 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-25 23:59:31,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:59:31,353 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;@51fa256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:59:31,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-11-25 23:59:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 1447 states, 1371 states have (on average 2.0437636761487963) internal successors, (2802), 1446 states have internal predecessors, (2802), 0 states have call successors, (0), 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-25 23:59:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 23:59:31,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:31,364 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 23:59:31,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 927, now seen corresponding path program 1 times [2022-11-25 23:59:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:31,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536603216] [2022-11-25 23:59:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:31,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:31,541 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-25 23:59:31,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:31,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536603216] [2022-11-25 23:59:31,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536603216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:31,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:31,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 23:59:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114152342] [2022-11-25 23:59:31,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:31,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:59:31,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:31,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:59:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:59:31,593 INFO L87 Difference]: Start difference. First operand has 1447 states, 1371 states have (on average 2.0437636761487963) internal successors, (2802), 1446 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:32,258 INFO L93 Difference]: Finished difference Result 1285 states and 2496 transitions. [2022-11-25 23:59:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:59:32,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-25 23:59:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:32,283 INFO L225 Difference]: With dead ends: 1285 [2022-11-25 23:59:32,283 INFO L226 Difference]: Without dead ends: 1285 [2022-11-25 23:59:32,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:59:32,287 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:32,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:59:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2022-11-25 23:59:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2022-11-25 23:59:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1251 states have (on average 1.9952038369304557) internal successors, (2496), 1284 states have internal predecessors, (2496), 0 states have call successors, (0), 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-25 23:59:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2496 transitions. [2022-11-25 23:59:32,412 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2496 transitions. Word has length 1 [2022-11-25 23:59:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:32,413 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 2496 transitions. [2022-11-25 23:59:32,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2496 transitions. [2022-11-25 23:59:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:59:32,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:32,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:32,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:59:32,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:32,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1927758261, now seen corresponding path program 1 times [2022-11-25 23:59:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305311124] [2022-11-25 23:59:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:33,557 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-25 23:59:33,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305311124] [2022-11-25 23:59:33,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305311124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:33,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:33,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:59:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214966296] [2022-11-25 23:59:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:33,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:59:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:59:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:59:33,566 INFO L87 Difference]: Start difference. First operand 1285 states and 2496 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:35,589 INFO L93 Difference]: Finished difference Result 2028 states and 3927 transitions. [2022-11-25 23:59:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:59:35,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:59:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:35,600 INFO L225 Difference]: With dead ends: 2028 [2022-11-25 23:59:35,600 INFO L226 Difference]: Without dead ends: 2028 [2022-11-25 23:59:35,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:59:35,601 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:35,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 29 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 23:59:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-11-25 23:59:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1252. [2022-11-25 23:59:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1223 states have (on average 1.9877350776778413) internal successors, (2431), 1251 states have internal predecessors, (2431), 0 states have call successors, (0), 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-25 23:59:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2431 transitions. [2022-11-25 23:59:35,645 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2431 transitions. Word has length 7 [2022-11-25 23:59:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:35,646 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 2431 transitions. [2022-11-25 23:59:35,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2431 transitions. [2022-11-25 23:59:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:59:35,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:35,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:35,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:59:35,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -432244872, now seen corresponding path program 1 times [2022-11-25 23:59:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:35,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718703628] [2022-11-25 23:59:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:36,332 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-25 23:59:36,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718703628] [2022-11-25 23:59:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718703628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:36,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:36,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:59:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515625977] [2022-11-25 23:59:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:36,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:59:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:59:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:59:36,336 INFO L87 Difference]: Start difference. First operand 1252 states and 2431 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:38,930 INFO L93 Difference]: Finished difference Result 1990 states and 3852 transitions. [2022-11-25 23:59:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:59:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:59:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:38,939 INFO L225 Difference]: With dead ends: 1990 [2022-11-25 23:59:38,939 INFO L226 Difference]: Without dead ends: 1990 [2022-11-25 23:59:38,940 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-25 23:59:38,941 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:38,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 36 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 23:59:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-11-25 23:59:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1344. [2022-11-25 23:59:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1316 states have (on average 1.9840425531914894) internal successors, (2611), 1343 states have internal predecessors, (2611), 0 states have call successors, (0), 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-25 23:59:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2611 transitions. [2022-11-25 23:59:38,981 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2611 transitions. Word has length 9 [2022-11-25 23:59:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:38,981 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 2611 transitions. [2022-11-25 23:59:38,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2611 transitions. [2022-11-25 23:59:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:59:38,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:38,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:59:38,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1039173218, now seen corresponding path program 1 times [2022-11-25 23:59:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:38,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811085178] [2022-11-25 23:59:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:39,469 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-25 23:59:39,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:39,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811085178] [2022-11-25 23:59:39,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811085178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:39,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:39,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:59:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879003294] [2022-11-25 23:59:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:39,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:59:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:59:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:59:39,475 INFO L87 Difference]: Start difference. First operand 1344 states and 2611 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-25 23:59:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:41,377 INFO L93 Difference]: Finished difference Result 1312 states and 2548 transitions. [2022-11-25 23:59:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:59:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 11 [2022-11-25 23:59:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:41,385 INFO L225 Difference]: With dead ends: 1312 [2022-11-25 23:59:41,385 INFO L226 Difference]: Without dead ends: 1312 [2022-11-25 23:59:41,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:59:41,391 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 47 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:41,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 56 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 23:59:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-11-25 23:59:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2022-11-25 23:59:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1288 states have (on average 1.9782608695652173) internal successors, (2548), 1311 states have internal predecessors, (2548), 0 states have call successors, (0), 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-25 23:59:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2548 transitions. [2022-11-25 23:59:41,437 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2548 transitions. Word has length 11 [2022-11-25 23:59:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:41,437 INFO L495 AbstractCegarLoop]: Abstraction has 1312 states and 2548 transitions. [2022-11-25 23:59:41,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-25 23:59:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2548 transitions. [2022-11-25 23:59:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:59:41,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:41,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:41,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:59:41,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 755985668, now seen corresponding path program 1 times [2022-11-25 23:59:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:41,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961747541] [2022-11-25 23:59:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:42,095 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-25 23:59:42,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:42,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961747541] [2022-11-25 23:59:42,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961747541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:42,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:59:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723777447] [2022-11-25 23:59:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:59:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:59:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:59:42,099 INFO L87 Difference]: Start difference. First operand 1312 states and 2548 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:44,195 INFO L93 Difference]: Finished difference Result 1780 states and 3439 transitions. [2022-11-25 23:59:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:59:44,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 23:59:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:44,204 INFO L225 Difference]: With dead ends: 1780 [2022-11-25 23:59:44,204 INFO L226 Difference]: Without dead ends: 1768 [2022-11-25 23:59:44,205 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-25 23:59:44,205 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:44,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 43 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 23:59:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-11-25 23:59:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1486. [2022-11-25 23:59:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1462 states have (on average 1.9740082079343366) internal successors, (2886), 1485 states have internal predecessors, (2886), 0 states have call successors, (0), 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-25 23:59:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2886 transitions. [2022-11-25 23:59:44,251 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2886 transitions. Word has length 15 [2022-11-25 23:59:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:44,251 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 2886 transitions. [2022-11-25 23:59:44,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2886 transitions. [2022-11-25 23:59:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:59:44,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:44,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:59:44,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 651480730, now seen corresponding path program 1 times [2022-11-25 23:59:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:44,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225395094] [2022-11-25 23:59:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:44,947 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-25 23:59:44,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:44,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225395094] [2022-11-25 23:59:44,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225395094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:44,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:44,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:59:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546380865] [2022-11-25 23:59:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:44,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:59:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:44,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:59:44,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:59:44,950 INFO L87 Difference]: Start difference. First operand 1486 states and 2886 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-25 23:59:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:47,112 INFO L93 Difference]: Finished difference Result 1600 states and 3110 transitions. [2022-11-25 23:59:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:59:47,113 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 17 [2022-11-25 23:59:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:47,122 INFO L225 Difference]: With dead ends: 1600 [2022-11-25 23:59:47,122 INFO L226 Difference]: Without dead ends: 1600 [2022-11-25 23:59:47,123 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-25 23:59:47,127 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:47,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 23:59:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-11-25 23:59:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2022-11-25 23:59:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1576 states have (on average 1.9733502538071066) internal successors, (3110), 1599 states have internal predecessors, (3110), 0 states have call successors, (0), 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-25 23:59:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3110 transitions. [2022-11-25 23:59:47,184 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3110 transitions. Word has length 17 [2022-11-25 23:59:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:47,185 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 3110 transitions. [2022-11-25 23:59:47,185 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-25 23:59:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3110 transitions. [2022-11-25 23:59:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:59:47,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:47,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:47,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:59:47,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:47,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2147396777, now seen corresponding path program 1 times [2022-11-25 23:59:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:47,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214893793] [2022-11-25 23:59:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:47,401 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-25 23:59:47,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:47,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214893793] [2022-11-25 23:59:47,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214893793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:47,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:47,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:59:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412230851] [2022-11-25 23:59:47,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:47,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:59:47,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:59:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:59:47,404 INFO L87 Difference]: Start difference. First operand 1600 states and 3110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-25 23:59:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:48,464 INFO L93 Difference]: Finished difference Result 1167 states and 2188 transitions. [2022-11-25 23:59:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:59:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-25 23:59:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:48,470 INFO L225 Difference]: With dead ends: 1167 [2022-11-25 23:59:48,470 INFO L226 Difference]: Without dead ends: 1167 [2022-11-25 23:59:48,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:59:48,471 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 59 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:48,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:59:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-11-25 23:59:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1139. [2022-11-25 23:59:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1121 states have (on average 1.926851025869759) internal successors, (2160), 1138 states have internal predecessors, (2160), 0 states have call successors, (0), 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-25 23:59:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2160 transitions. [2022-11-25 23:59:48,504 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2160 transitions. Word has length 20 [2022-11-25 23:59:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:48,504 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 2160 transitions. [2022-11-25 23:59:48,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-25 23:59:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2160 transitions. [2022-11-25 23:59:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:59:48,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:48,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:48,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:59:48,506 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1809069743, now seen corresponding path program 1 times [2022-11-25 23:59:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:48,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91734199] [2022-11-25 23:59:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:49,063 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-25 23:59:49,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91734199] [2022-11-25 23:59:49,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91734199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:49,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:49,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:59:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206427232] [2022-11-25 23:59:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:49,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:59:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:59:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:59:49,066 INFO L87 Difference]: Start difference. First operand 1139 states and 2160 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:51,609 INFO L93 Difference]: Finished difference Result 1292 states and 2430 transitions. [2022-11-25 23:59:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:59:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:59:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:51,615 INFO L225 Difference]: With dead ends: 1292 [2022-11-25 23:59:51,615 INFO L226 Difference]: Without dead ends: 1250 [2022-11-25 23:59:51,616 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-25 23:59:51,616 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:51,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 56 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 23:59:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-11-25 23:59:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1116. [2022-11-25 23:59:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1101 states have (on average 1.9073569482288828) internal successors, (2100), 1115 states have internal predecessors, (2100), 0 states have call successors, (0), 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-25 23:59:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2100 transitions. [2022-11-25 23:59:51,650 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 2100 transitions. Word has length 23 [2022-11-25 23:59:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:51,651 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 2100 transitions. [2022-11-25 23:59:51,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 2100 transitions. [2022-11-25 23:59:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:59:51,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:51,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:51,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:59:51,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash -359166801, now seen corresponding path program 1 times [2022-11-25 23:59:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:51,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770580383] [2022-11-25 23:59:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:52,197 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-25 23:59:52,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770580383] [2022-11-25 23:59:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770580383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:52,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:52,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:59:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922048235] [2022-11-25 23:59:52,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:52,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:59:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:59:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:59:52,202 INFO L87 Difference]: Start difference. First operand 1116 states and 2100 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:54,160 INFO L93 Difference]: Finished difference Result 1081 states and 2032 transitions. [2022-11-25 23:59:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:59:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 23:59:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:54,166 INFO L225 Difference]: With dead ends: 1081 [2022-11-25 23:59:54,166 INFO L226 Difference]: Without dead ends: 1081 [2022-11-25 23:59:54,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:59:54,167 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:54,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 58 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 23:59:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-11-25 23:59:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2022-11-25 23:59:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.900841908325538) internal successors, (2032), 1080 states have internal predecessors, (2032), 0 states have call successors, (0), 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-25 23:59:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 2032 transitions. [2022-11-25 23:59:54,198 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 2032 transitions. Word has length 27 [2022-11-25 23:59:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:54,199 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 2032 transitions. [2022-11-25 23:59:54,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 2032 transitions. [2022-11-25 23:59:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:59:54,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:54,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:54,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:59:54,201 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1552923190, now seen corresponding path program 1 times [2022-11-25 23:59:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:54,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606921902] [2022-11-25 23:59:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:54,944 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-25 23:59:54,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:54,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606921902] [2022-11-25 23:59:54,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606921902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:54,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:54,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:59:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325953005] [2022-11-25 23:59:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:54,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:59:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:59:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:59:54,947 INFO L87 Difference]: Start difference. First operand 1081 states and 2032 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:59:57,016 INFO L93 Difference]: Finished difference Result 1194 states and 2244 transitions. [2022-11-25 23:59:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:59:57,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 23:59:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:59:57,022 INFO L225 Difference]: With dead ends: 1194 [2022-11-25 23:59:57,022 INFO L226 Difference]: Without dead ends: 1132 [2022-11-25 23:59:57,023 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-25 23:59:57,024 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:59:57,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 60 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 23:59:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-11-25 23:59:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2022-11-25 23:59:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1120 states have (on average 1.8821428571428571) internal successors, (2108), 1131 states have internal predecessors, (2108), 0 states have call successors, (0), 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-25 23:59:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2108 transitions. [2022-11-25 23:59:57,056 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2108 transitions. Word has length 33 [2022-11-25 23:59:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:59:57,057 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 2108 transitions. [2022-11-25 23:59:57,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2108 transitions. [2022-11-25 23:59:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:59:57,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:59:57,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:59:57,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:59:57,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-25 23:59:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:59:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1881511640, now seen corresponding path program 1 times [2022-11-25 23:59:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:59:57,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921657704] [2022-11-25 23:59:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:59:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:59:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:59:59,302 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-25 23:59:59,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:59:59,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921657704] [2022-11-25 23:59:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921657704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:59:59,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:59:59,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:59:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29895570] [2022-11-25 23:59:59,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:59:59,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:59:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:59:59,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:59:59,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:59:59,304 INFO L87 Difference]: Start difference. First operand 1132 states and 2108 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:01,837 INFO L93 Difference]: Finished difference Result 1258 states and 2345 transitions. [2022-11-26 00:00:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:00:01,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-26 00:00:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:01,844 INFO L225 Difference]: With dead ends: 1258 [2022-11-26 00:00:01,845 INFO L226 Difference]: Without dead ends: 1258 [2022-11-26 00:00:01,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:00:01,846 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:01,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 53 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-26 00:00:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2022-11-26 00:00:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1183. [2022-11-26 00:00:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1171 states have (on average 1.8898377455166524) internal successors, (2213), 1182 states have internal predecessors, (2213), 0 states have call successors, (0), 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-26 00:00:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2213 transitions. [2022-11-26 00:00:01,881 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 2213 transitions. Word has length 34 [2022-11-26 00:00:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:01,881 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 2213 transitions. [2022-11-26 00:00:01,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 2213 transitions. [2022-11-26 00:00:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:00:01,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:01,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:01,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:00:01,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash 33330476, now seen corresponding path program 1 times [2022-11-26 00:00:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:01,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072294699] [2022-11-26 00:00:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:03,923 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-26 00:00:03,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:03,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072294699] [2022-11-26 00:00:03,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072294699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:03,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:03,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:00:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152046468] [2022-11-26 00:00:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:03,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:00:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:03,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:00:03,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:00:03,925 INFO L87 Difference]: Start difference. First operand 1183 states and 2213 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:06,481 INFO L93 Difference]: Finished difference Result 1173 states and 2190 transitions. [2022-11-26 00:00:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:00:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-26 00:00:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:06,488 INFO L225 Difference]: With dead ends: 1173 [2022-11-26 00:00:06,488 INFO L226 Difference]: Without dead ends: 1173 [2022-11-26 00:00:06,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:00:06,489 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 133 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:06,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 77 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 00:00:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-26 00:00:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1133. [2022-11-26 00:00:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 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-26 00:00:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-26 00:00:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-26 00:00:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:06,521 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-26 00:00:06,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-26 00:00:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:00:06,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:06,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:06,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:00:06,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:06,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1274134364, now seen corresponding path program 2 times [2022-11-26 00:00:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:06,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207045760] [2022-11-26 00:00:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:08,256 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-26 00:00:08,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207045760] [2022-11-26 00:00:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207045760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:08,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:08,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 00:00:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666510122] [2022-11-26 00:00:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:00:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:00:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:00:08,258 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:10,672 INFO L93 Difference]: Finished difference Result 1452 states and 2692 transitions. [2022-11-26 00:00:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:00:10,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-26 00:00:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:10,678 INFO L225 Difference]: With dead ends: 1452 [2022-11-26 00:00:10,678 INFO L226 Difference]: Without dead ends: 1452 [2022-11-26 00:00:10,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:00:10,679 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:10,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-26 00:00:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2022-11-26 00:00:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1133. [2022-11-26 00:00:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 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-26 00:00:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-26 00:00:10,707 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-26 00:00:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:10,707 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-26 00:00:10,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-26 00:00:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:00:10,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:10,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:10,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:00:10,709 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1261741936, now seen corresponding path program 3 times [2022-11-26 00:00:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:10,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577178407] [2022-11-26 00:00:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:12,753 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-26 00:00:12,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:12,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577178407] [2022-11-26 00:00:12,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577178407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:12,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:12,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:00:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319537219] [2022-11-26 00:00:12,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:12,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:00:12,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:00:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:00:12,756 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:16,514 INFO L93 Difference]: Finished difference Result 1484 states and 2756 transitions. [2022-11-26 00:00:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:00:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-26 00:00:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:16,520 INFO L225 Difference]: With dead ends: 1484 [2022-11-26 00:00:16,520 INFO L226 Difference]: Without dead ends: 1484 [2022-11-26 00:00:16,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:00:16,521 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 84 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:16,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 64 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-26 00:00:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-11-26 00:00:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1133. [2022-11-26 00:00:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 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-26 00:00:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-26 00:00:16,548 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-26 00:00:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:16,548 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-26 00:00:16,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-26 00:00:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:00:16,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:16,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:16,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:00:16,550 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -339902620, now seen corresponding path program 4 times [2022-11-26 00:00:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:16,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777607075] [2022-11-26 00:00:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:18,042 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-26 00:00:18,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:18,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777607075] [2022-11-26 00:00:18,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777607075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:18,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:18,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 00:00:18,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225260556] [2022-11-26 00:00:18,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:18,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:00:18,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:18,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:00:18,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:00:18,044 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:21,953 INFO L93 Difference]: Finished difference Result 1502 states and 2792 transitions. [2022-11-26 00:00:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:00:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-26 00:00:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:21,959 INFO L225 Difference]: With dead ends: 1502 [2022-11-26 00:00:21,959 INFO L226 Difference]: Without dead ends: 1502 [2022-11-26 00:00:21,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:00:21,960 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:21,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 80 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-26 00:00:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-26 00:00:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1133. [2022-11-26 00:00:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1122 states have (on average 1.8805704099821747) internal successors, (2110), 1132 states have internal predecessors, (2110), 0 states have call successors, (0), 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-26 00:00:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2110 transitions. [2022-11-26 00:00:21,988 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2110 transitions. Word has length 34 [2022-11-26 00:00:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:21,988 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 2110 transitions. [2022-11-26 00:00:21,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2110 transitions. [2022-11-26 00:00:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:00:21,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:21,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:21,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:00:21,990 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash 640605290, now seen corresponding path program 5 times [2022-11-26 00:00:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:21,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355911534] [2022-11-26 00:00:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:21,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:23,347 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-26 00:00:23,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:23,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355911534] [2022-11-26 00:00:23,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355911534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:23,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:23,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 00:00:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146796603] [2022-11-26 00:00:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:23,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:00:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:00:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:00:23,350 INFO L87 Difference]: Start difference. First operand 1133 states and 2110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:27,146 INFO L93 Difference]: Finished difference Result 1472 states and 2732 transitions. [2022-11-26 00:00:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:00:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-26 00:00:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:27,151 INFO L225 Difference]: With dead ends: 1472 [2022-11-26 00:00:27,152 INFO L226 Difference]: Without dead ends: 1472 [2022-11-26 00:00:27,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:00:27,153 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:27,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 77 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-26 00:00:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-11-26 00:00:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1077. [2022-11-26 00:00:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1066 states have (on average 1.874296435272045) internal successors, (1998), 1076 states have internal predecessors, (1998), 0 states have call successors, (0), 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-26 00:00:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1998 transitions. [2022-11-26 00:00:27,179 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1998 transitions. Word has length 34 [2022-11-26 00:00:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:27,179 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1998 transitions. [2022-11-26 00:00:27,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-26 00:00:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1998 transitions. [2022-11-26 00:00:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:00:27,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:27,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:27,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:00:27,182 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash 622573053, now seen corresponding path program 1 times [2022-11-26 00:00:27,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:27,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231787218] [2022-11-26 00:00:27,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:27,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:28,998 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-26 00:00:28,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:28,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231787218] [2022-11-26 00:00:28,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231787218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:28,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:28,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:00:28,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141926860] [2022-11-26 00:00:28,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:28,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:00:28,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:00:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:00:29,000 INFO L87 Difference]: Start difference. First operand 1077 states and 1998 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:32,421 INFO L93 Difference]: Finished difference Result 1477 states and 2744 transitions. [2022-11-26 00:00:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:00:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-26 00:00:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:32,425 INFO L225 Difference]: With dead ends: 1477 [2022-11-26 00:00:32,425 INFO L226 Difference]: Without dead ends: 1475 [2022-11-26 00:00:32,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:00:32,426 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 267 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:32,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 51 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-26 00:00:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2022-11-26 00:00:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1128. [2022-11-26 00:00:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1117 states have (on average 1.8818263205013428) internal successors, (2102), 1127 states have internal predecessors, (2102), 0 states have call successors, (0), 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-26 00:00:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2102 transitions. [2022-11-26 00:00:32,454 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2102 transitions. Word has length 36 [2022-11-26 00:00:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:32,454 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 2102 transitions. [2022-11-26 00:00:32,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2102 transitions. [2022-11-26 00:00:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:00:32,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:32,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:32,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:00:32,461 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash 531358594, now seen corresponding path program 1 times [2022-11-26 00:00:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:32,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534083163] [2022-11-26 00:00:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:33,948 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-26 00:00:33,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:33,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534083163] [2022-11-26 00:00:33,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534083163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:33,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:33,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-26 00:00:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388183847] [2022-11-26 00:00:33,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:33,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:00:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:33,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:00:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:00:33,950 INFO L87 Difference]: Start difference. First operand 1128 states and 2102 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:37,350 INFO L93 Difference]: Finished difference Result 1118 states and 2079 transitions. [2022-11-26 00:00:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:00:37,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-26 00:00:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:37,354 INFO L225 Difference]: With dead ends: 1118 [2022-11-26 00:00:37,354 INFO L226 Difference]: Without dead ends: 1118 [2022-11-26 00:00:37,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:00:37,355 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 238 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:37,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 155 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-26 00:00:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-11-26 00:00:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1078. [2022-11-26 00:00:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1068 states have (on average 1.8745318352059925) internal successors, (2002), 1077 states have internal predecessors, (2002), 0 states have call successors, (0), 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-26 00:00:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2002 transitions. [2022-11-26 00:00:37,385 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2002 transitions. Word has length 36 [2022-11-26 00:00:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:37,386 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 2002 transitions. [2022-11-26 00:00:37,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2002 transitions. [2022-11-26 00:00:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:00:37,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:37,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 00:00:37,391 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1135975549, now seen corresponding path program 2 times [2022-11-26 00:00:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359065012] [2022-11-26 00:00:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:39,272 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-26 00:00:39,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:39,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359065012] [2022-11-26 00:00:39,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359065012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:39,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:39,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-26 00:00:39,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554264693] [2022-11-26 00:00:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:39,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:00:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:39,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:00:39,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:00:39,274 INFO L87 Difference]: Start difference. First operand 1078 states and 2002 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:42,959 INFO L93 Difference]: Finished difference Result 1072 states and 1991 transitions. [2022-11-26 00:00:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:00:42,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-26 00:00:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:42,961 INFO L225 Difference]: With dead ends: 1072 [2022-11-26 00:00:42,962 INFO L226 Difference]: Without dead ends: 1064 [2022-11-26 00:00:42,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:00:42,962 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 174 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:42,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 22 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-26 00:00:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-11-26 00:00:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1009. [2022-11-26 00:00:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1000 states have (on average 1.871) internal successors, (1871), 1008 states have internal predecessors, (1871), 0 states have call successors, (0), 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-26 00:00:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1871 transitions. [2022-11-26 00:00:42,984 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1871 transitions. Word has length 36 [2022-11-26 00:00:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:42,984 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1871 transitions. [2022-11-26 00:00:42,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1871 transitions. [2022-11-26 00:00:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 00:00:42,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:42,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:42,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 00:00:42,986 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2108876762, now seen corresponding path program 1 times [2022-11-26 00:00:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:42,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650606740] [2022-11-26 00:00:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:43,999 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-26 00:00:44,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:44,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650606740] [2022-11-26 00:00:44,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650606740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:44,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:44,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:00:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100071781] [2022-11-26 00:00:44,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:44,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:00:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:00:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:00:44,002 INFO L87 Difference]: Start difference. First operand 1009 states and 1871 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:46,414 INFO L93 Difference]: Finished difference Result 1132 states and 2102 transitions. [2022-11-26 00:00:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:00:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-26 00:00:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:46,416 INFO L225 Difference]: With dead ends: 1132 [2022-11-26 00:00:46,417 INFO L226 Difference]: Without dead ends: 1132 [2022-11-26 00:00:46,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:00:46,417 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:46,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 63 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-26 00:00:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-11-26 00:00:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1047. [2022-11-26 00:00:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1038 states have (on average 1.8757225433526012) internal successors, (1947), 1046 states have internal predecessors, (1947), 0 states have call successors, (0), 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-26 00:00:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1947 transitions. [2022-11-26 00:00:46,438 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1947 transitions. Word has length 38 [2022-11-26 00:00:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:46,439 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1947 transitions. [2022-11-26 00:00:46,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1947 transitions. [2022-11-26 00:00:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 00:00:46,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:46,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:46,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 00:00:46,441 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1090761962, now seen corresponding path program 2 times [2022-11-26 00:00:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:46,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504834680] [2022-11-26 00:00:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:47,614 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-26 00:00:47,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:47,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504834680] [2022-11-26 00:00:47,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504834680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:47,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:47,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:00:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447883226] [2022-11-26 00:00:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:00:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:00:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:00:47,617 INFO L87 Difference]: Start difference. First operand 1047 states and 1947 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:50,397 INFO L93 Difference]: Finished difference Result 1142 states and 2122 transitions. [2022-11-26 00:00:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:00:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-26 00:00:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:50,400 INFO L225 Difference]: With dead ends: 1142 [2022-11-26 00:00:50,400 INFO L226 Difference]: Without dead ends: 1142 [2022-11-26 00:00:50,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:00:50,401 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 75 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:50,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 72 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-26 00:00:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-11-26 00:00:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1046. [2022-11-26 00:00:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1037 states have (on average 1.875602700096432) internal successors, (1945), 1045 states have internal predecessors, (1945), 0 states have call successors, (0), 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-26 00:00:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1945 transitions. [2022-11-26 00:00:50,423 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1945 transitions. Word has length 38 [2022-11-26 00:00:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:50,423 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1945 transitions. [2022-11-26 00:00:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1945 transitions. [2022-11-26 00:00:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 00:00:50,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:50,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-26 00:00:50,425 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 831450838, now seen corresponding path program 3 times [2022-11-26 00:00:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052586361] [2022-11-26 00:00:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:00:51,554 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-26 00:00:51,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:00:51,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052586361] [2022-11-26 00:00:51,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052586361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:00:51,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:00:51,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-26 00:00:51,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491708212] [2022-11-26 00:00:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:00:51,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:00:51,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:00:51,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:00:51,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:00:51,556 INFO L87 Difference]: Start difference. First operand 1046 states and 1945 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:00:54,342 INFO L93 Difference]: Finished difference Result 1080 states and 2004 transitions. [2022-11-26 00:00:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:00:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-26 00:00:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:00:54,345 INFO L225 Difference]: With dead ends: 1080 [2022-11-26 00:00:54,345 INFO L226 Difference]: Without dead ends: 1080 [2022-11-26 00:00:54,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:00:54,346 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 171 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:00:54,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 90 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 00:00:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-11-26 00:00:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 976. [2022-11-26 00:00:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 967 states have (on average 1.8728024819027922) internal successors, (1811), 975 states have internal predecessors, (1811), 0 states have call successors, (0), 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-26 00:00:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1811 transitions. [2022-11-26 00:00:54,367 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1811 transitions. Word has length 38 [2022-11-26 00:00:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:00:54,367 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1811 transitions. [2022-11-26 00:00:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:00:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1811 transitions. [2022-11-26 00:00:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 00:00:54,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:00:54,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:54,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-26 00:00:54,369 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-11-26 00:00:54,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:00:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash 670038863, now seen corresponding path program 1 times [2022-11-26 00:00:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:00:54,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677311607] [2022-11-26 00:00:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:00:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:00:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:00:54,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:00:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:00:54,619 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:00:54,619 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:00:54,620 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2022-11-26 00:00:54,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2022-11-26 00:00:54,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2022-11-26 00:00:54,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2022-11-26 00:00:54,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2022-11-26 00:00:54,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2022-11-26 00:00:54,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2022-11-26 00:00:54,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2022-11-26 00:00:54,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2022-11-26 00:00:54,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2022-11-26 00:00:54,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2022-11-26 00:00:54,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2022-11-26 00:00:54,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2022-11-26 00:00:54,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2022-11-26 00:00:54,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2022-11-26 00:00:54,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2022-11-26 00:00:54,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2022-11-26 00:00:54,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2022-11-26 00:00:54,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2022-11-26 00:00:54,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2022-11-26 00:00:54,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 37 remaining) [2022-11-26 00:00:54,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2022-11-26 00:00:54,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2022-11-26 00:00:54,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2022-11-26 00:00:54,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2022-11-26 00:00:54,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2022-11-26 00:00:54,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2022-11-26 00:00:54,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2022-11-26 00:00:54,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2022-11-26 00:00:54,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2022-11-26 00:00:54,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2022-11-26 00:00:54,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2022-11-26 00:00:54,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2022-11-26 00:00:54,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2022-11-26 00:00:54,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2022-11-26 00:00:54,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2022-11-26 00:00:54,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2022-11-26 00:00:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-26 00:00:54,634 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:00:54,642 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-26 00:00:54,642 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:00:54,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:00:54 BasicIcfg [2022-11-26 00:00:54,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:00:54,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:00:54,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:00:54,742 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:00:54,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:49" (3/4) ... [2022-11-26 00:00:54,745 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-26 00:00:54,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:00:54,746 INFO L158 Benchmark]: Toolchain (without parser) took 847880.03ms. Allocated memory was 174.1MB in the beginning and 612.4MB in the end (delta: 438.3MB). Free memory was 128.3MB in the beginning and 467.0MB in the end (delta: -338.8MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2022-11-26 00:00:54,747 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 174.1MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:00:54,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.47ms. Allocated memory is still 174.1MB. Free memory was 128.1MB in the beginning and 88.7MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-26 00:00:54,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.67ms. Allocated memory is still 174.1MB. Free memory was 88.7MB in the beginning and 85.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:00:54,748 INFO L158 Benchmark]: Boogie Preprocessor took 82.84ms. Allocated memory is still 174.1MB. Free memory was 85.1MB in the beginning and 81.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:00:54,750 INFO L158 Benchmark]: RCFGBuilder took 1217.96ms. Allocated memory was 174.1MB in the beginning and 237.0MB in the end (delta: 62.9MB). Free memory was 81.7MB in the beginning and 179.1MB in the end (delta: -97.4MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-11-26 00:00:54,751 INFO L158 Benchmark]: TraceAbstraction took 845656.36ms. Allocated memory was 237.0MB in the beginning and 612.4MB in the end (delta: 375.4MB). Free memory was 179.1MB in the beginning and 467.0MB in the end (delta: -288.0MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2022-11-26 00:00:54,751 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 612.4MB. Free memory is still 467.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:00:54,762 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.25ms. Allocated memory is still 174.1MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.47ms. Allocated memory is still 174.1MB. Free memory was 128.1MB in the beginning and 88.7MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.67ms. Allocated memory is still 174.1MB. Free memory was 88.7MB in the beginning and 85.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.84ms. Allocated memory is still 174.1MB. Free memory was 85.1MB in the beginning and 81.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1217.96ms. Allocated memory was 174.1MB in the beginning and 237.0MB in the end (delta: 62.9MB). Free memory was 81.7MB in the beginning and 179.1MB in the end (delta: -97.4MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 845656.36ms. Allocated memory was 237.0MB in the beginning and 612.4MB in the end (delta: 375.4MB). Free memory was 179.1MB in the beginning and 467.0MB in the end (delta: -288.0MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 612.4MB. Free memory is still 467.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 761.9s, 280 PlacesBefore, 95 PlacesAfterwards, 276 TransitionsBefore, 91 TransitionsAfterwards, 7728 CoEnabledTransitionPairs, 18 FixpointIterations, 195 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 288 TotalNumberOfCompositions, 102063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18236, independent: 15700, independent conditional: 0, independent unconditional: 15700, dependent: 2536, dependent conditional: 0, dependent unconditional: 2536, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5493, independent: 5240, independent conditional: 0, independent unconditional: 5240, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5493, independent: 4068, independent conditional: 0, independent unconditional: 4068, dependent: 1425, dependent conditional: 0, dependent unconditional: 1425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1425, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2338, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 705, dependent conditional: 0, dependent unconditional: 705, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18236, independent: 10460, independent conditional: 0, independent unconditional: 10460, dependent: 2283, dependent conditional: 0, dependent unconditional: 2283, unknown: 5493, unknown conditional: 0, unknown unconditional: 5493] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 925, Positive conditional cache size: 0, Positive unconditional cache size: 925, Negative cache size: 123, Negative conditional cache size: 0, Negative unconditional cache size: 123, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] 0 init(A,3) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] 0 init(B,5) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next [L1251] 0 B->next = p [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-2:0}, A->next={-3:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, t1={13:0}] [L1254] 0 p = A->next [L1255] EXPR 0 p->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) [L1258] EXPR 0 B->next VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={11:0}, B->next={-3:0}, B_mutex={2:0}, p={-3:0}, t1={13:0}] [L1235] EXPR 1 A->next [L1235] EXPR 1 A->next->datum [L1235] 1 A->next->datum++ VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=9, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={2:0}] [L1258] 0 p = B->next [L1259] EXPR 0 p->datum VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=9, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, p->datum=10, t1={13:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=44, A->next->datum++=9, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={2:0}, p={-3:0}, p->datum=10, t1={13:0}] 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->next->datum++ [1235] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: B = malloc(sizeof(struct s)) [1249] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: B->next = p [1251] * C: B->next = p [1251] * C: A->next = p [1248] * C: B->next = p [1251] * C: A = malloc(sizeof(struct s)) [1246] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: A->next = p [1248] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: 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: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: 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, 348 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 845.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 56.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 762.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2116 SdHoareTripleChecker+Valid, 54.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2116 mSDsluCounter, 1412 SdHoareTripleChecker+Invalid, 52.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 1871 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13233 IncrementalHoareTripleChecker+Invalid, 15104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1871 mSolverCounterUnsat, 667 mSDtfsCounter, 13233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1600occurred in iteration=6, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 4142 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 8801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-26 00:00:54,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cb79123-31f8-4078-8c11-02b334494b7b/bin/utaipan-ByfvJB40ur/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