./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --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 38d4dff022ef4d2ea830e2718ea99215413d1e3f67567ac017eaf8275c303ef0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:13:22,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:13:22,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:13:22,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:13:22,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:13:22,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:13:22,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:13:22,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:13:22,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:13:22,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:13:22,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:13:22,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:13:22,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:13:22,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:13:22,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:13:22,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:13:22,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:13:22,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:13:22,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:13:22,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:13:22,926 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:13:22,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:13:22,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:13:22,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:13:22,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:13:22,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:13:22,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:13:22,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:13:22,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:13:22,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:13:22,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:13:22,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:13:22,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:13:22,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:13:22,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:13:22,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:13:22,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:13:22,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:13:22,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:13:22,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:13:22,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:13:22,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:13:22,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-04-18 20:13:22,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:13:22,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:13:22,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:13:22,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:13:22,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:13:22,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:13:22,980 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:13:22,980 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:13:22,980 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:13:22,981 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 20:13:22,981 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:13:22,981 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:13:22,981 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 20:13:22,981 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 20:13:22,981 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:13:22,981 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 20:13:22,982 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 20:13:22,982 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 20:13:22,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:13:22,984 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:13:22,984 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:13:22,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 20:13:22,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:13:22,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:13:22,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:13:22,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:13:22,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:13:22,985 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:13:22,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:13:22,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:13:22,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:13:22,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:13:22,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:13:22,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:13:22,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:13:22,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:13:22,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:13:22,987 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux 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 -> 38d4dff022ef4d2ea830e2718ea99215413d1e3f67567ac017eaf8275c303ef0 [2022-04-18 20:13:23,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:13:23,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:13:23,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:13:23,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:13:23,201 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:13:23,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i [2022-04-18 20:13:23,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/946af0206/2ad3b8927f644f2dbfb3c1b8669e1046/FLAG09cf59c00 [2022-04-18 20:13:23,631 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:13:23,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i [2022-04-18 20:13:23,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/946af0206/2ad3b8927f644f2dbfb3c1b8669e1046/FLAG09cf59c00 [2022-04-18 20:13:23,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/946af0206/2ad3b8927f644f2dbfb3c1b8669e1046 [2022-04-18 20:13:23,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:13:23,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:13:23,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:13:23,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:13:23,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:13:23,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:13:23" (1/1) ... [2022-04-18 20:13:23,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a462ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:23, skipping insertion in model container [2022-04-18 20:13:23,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:13:23" (1/1) ... [2022-04-18 20:13:23,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:13:23,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:13:23,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i[30813,30826] [2022-04-18 20:13:23,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:13:23,923 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:13:23,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i[30813,30826] [2022-04-18 20:13:23,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:13:24,011 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:13:24,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24 WrapperNode [2022-04-18 20:13:24,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:13:24,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:13:24,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:13:24,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:13:24,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,063 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-04-18 20:13:24,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:13:24,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:13:24,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:13:24,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:13:24,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:13:24,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:13:24,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:13:24,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:13:24,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (1/1) ... [2022-04-18 20:13:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:13:24,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:24,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 20:13:24,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 20:13:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-04-18 20:13:24,147 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-04-18 20:13:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-04-18 20:13:24,147 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-04-18 20:13:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 20:13:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:13:24,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:13:24,149 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 20:13:24,245 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:13:24,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:13:24,563 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:13:24,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:13:24,594 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-18 20:13:24,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:13:24 BoogieIcfgContainer [2022-04-18 20:13:24,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:13:24,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:13:24,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:13:24,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:13:24,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:13:23" (1/3) ... [2022-04-18 20:13:24,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b98b7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:13:24, skipping insertion in model container [2022-04-18 20:13:24,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:24" (2/3) ... [2022-04-18 20:13:24,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b98b7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:13:24, skipping insertion in model container [2022-04-18 20:13:24,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:13:24" (3/3) ... [2022-04-18 20:13:24,603 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2022-04-18 20:13:24,607 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:13:24,607 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:13:24,607 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-04-18 20:13:24,608 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:13:24,664 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 20:13:24,714 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:13:24,718 INFO L340 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 [2022-04-18 20:13:24,719 INFO L341 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-04-18 20:13:24,732 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:13:24,743 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 193 transitions, 396 flow [2022-04-18 20:13:24,748 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 193 transitions, 396 flow [2022-04-18 20:13:24,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-04-18 20:13:24,801 INFO L129 PetriNetUnfolder]: 8/191 cut-off events. [2022-04-18 20:13:24,802 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 20:13:24,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 363 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-04-18 20:13:24,821 INFO L116 LiptonReduction]: Number of co-enabled transitions 13080 [2022-04-18 20:13:28,042 INFO L131 LiptonReduction]: Checked pairs total: 16175 [2022-04-18 20:13:28,043 INFO L133 LiptonReduction]: Total number of compositions: 235 [2022-04-18 20:13:28,048 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 50 transitions, 110 flow [2022-04-18 20:13:28,121 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-04-18 20:13:28,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:28,131 INFO L499 BasicCegarLoop]: trace histogram [1] [2022-04-18 20:13:28,131 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash 804, now seen corresponding path program 1 times [2022-04-18 20:13:28,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:28,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281289902] [2022-04-18 20:13:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:28,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:28,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281289902] [2022-04-18 20:13:28,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281289902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:13:28,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:13:28,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-04-18 20:13:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298716535] [2022-04-18 20:13:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:13:28,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 20:13:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 20:13:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:13:28,238 INFO L87 Difference]: Start difference. First operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:28,271 INFO L93 Difference]: Finished difference Result 87 states and 251 transitions. [2022-04-18 20:13:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 20:13:28,273 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-04-18 20:13:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:28,279 INFO L225 Difference]: With dead ends: 87 [2022-04-18 20:13:28,280 INFO L226 Difference]: Without dead ends: 71 [2022-04-18 20:13:28,280 INFO L912 BasicCegarLoop]: 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-04-18 20:13:28,283 INFO L913 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:28,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-18 20:13:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-18 20:13:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 2.9420289855072466) internal successors, (203), 70 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 203 transitions. [2022-04-18 20:13:28,309 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 203 transitions. Word has length 1 [2022-04-18 20:13:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:28,310 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 203 transitions. [2022-04-18 20:13:28,310 INFO L479 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-04-18 20:13:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 203 transitions. [2022-04-18 20:13:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-04-18 20:13:28,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:28,311 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:28,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 20:13:28,312 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2042717108, now seen corresponding path program 1 times [2022-04-18 20:13:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:28,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522153711] [2022-04-18 20:13:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:28,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:28,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522153711] [2022-04-18 20:13:28,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522153711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:13:28,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:13:28,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 20:13:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661446285] [2022-04-18 20:13:28,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:13:28,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:13:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:13:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:13:28,437 INFO L87 Difference]: Start difference. First operand 71 states and 203 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:28,467 INFO L93 Difference]: Finished difference Result 80 states and 230 transitions. [2022-04-18 20:13:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:13:28,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-04-18 20:13:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:28,468 INFO L225 Difference]: With dead ends: 80 [2022-04-18 20:13:28,469 INFO L226 Difference]: Without dead ends: 80 [2022-04-18 20:13:28,470 INFO L912 BasicCegarLoop]: 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-04-18 20:13:28,471 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:28,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-18 20:13:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-18 20:13:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 2.948717948717949) internal successors, (230), 79 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 230 transitions. [2022-04-18 20:13:28,486 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 230 transitions. Word has length 7 [2022-04-18 20:13:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:28,486 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 230 transitions. [2022-04-18 20:13:28,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 230 transitions. [2022-04-18 20:13:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-04-18 20:13:28,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:28,488 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:28,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 20:13:28,488 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1100327291, now seen corresponding path program 1 times [2022-04-18 20:13:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:28,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110274840] [2022-04-18 20:13:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:13:28,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110274840] [2022-04-18 20:13:28,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110274840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:13:28,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:13:28,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 20:13:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181701567] [2022-04-18 20:13:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:13:28,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:13:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:13:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:13:28,549 INFO L87 Difference]: Start difference. First operand 80 states and 230 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:28,580 INFO L93 Difference]: Finished difference Result 123 states and 355 transitions. [2022-04-18 20:13:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:13:28,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-04-18 20:13:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:28,584 INFO L225 Difference]: With dead ends: 123 [2022-04-18 20:13:28,585 INFO L226 Difference]: Without dead ends: 123 [2022-04-18 20:13:28,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:13:28,587 INFO L913 BasicCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:28,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-18 20:13:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2022-04-18 20:13:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 2.950617283950617) internal successors, (239), 82 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 239 transitions. [2022-04-18 20:13:28,604 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 239 transitions. Word has length 8 [2022-04-18 20:13:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:28,606 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 239 transitions. [2022-04-18 20:13:28,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 239 transitions. [2022-04-18 20:13:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-18 20:13:28,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:28,607 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:28,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 20:13:28,608 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1561612251, now seen corresponding path program 1 times [2022-04-18 20:13:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:28,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985459192] [2022-04-18 20:13:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:28,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:28,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985459192] [2022-04-18 20:13:28,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985459192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:28,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239631607] [2022-04-18 20:13:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:28,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:28,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:28,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:13:28,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 20:13:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:28,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 20:13:28,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:28,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:28,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239631607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:28,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [694544604] [2022-04-18 20:13:28,818 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:13:28,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:28,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-04-18 20:13:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600078379] [2022-04-18 20:13:28,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:28,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 20:13:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 20:13:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:13:28,822 INFO L87 Difference]: Start difference. First operand 83 states and 239 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:28,864 INFO L93 Difference]: Finished difference Result 110 states and 320 transitions. [2022-04-18 20:13:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:13:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-04-18 20:13:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:28,866 INFO L225 Difference]: With dead ends: 110 [2022-04-18 20:13:28,866 INFO L226 Difference]: Without dead ends: 110 [2022-04-18 20:13:28,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:13:28,867 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:28,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-18 20:13:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-18 20:13:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 2.962962962962963) internal successors, (320), 109 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 320 transitions. [2022-04-18 20:13:28,887 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 320 transitions. Word has length 10 [2022-04-18 20:13:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:28,887 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 320 transitions. [2022-04-18 20:13:28,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 320 transitions. [2022-04-18 20:13:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 20:13:28,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:28,889 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:28,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:29,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:29,106 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2052048368, now seen corresponding path program 2 times [2022-04-18 20:13:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154502419] [2022-04-18 20:13:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:29,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:29,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154502419] [2022-04-18 20:13:29,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154502419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:29,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047433260] [2022-04-18 20:13:29,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:13:29,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:29,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:29,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:13:29,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 20:13:29,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-18 20:13:29,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:13:29,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 20:13:29,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:29,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:29,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047433260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:29,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1004642690] [2022-04-18 20:13:29,331 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:13:29,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:29,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-18 20:13:29,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211685404] [2022-04-18 20:13:29,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:29,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-18 20:13:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:29,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-18 20:13:29,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:13:29,333 INFO L87 Difference]: Start difference. First operand 110 states and 320 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:29,455 INFO L93 Difference]: Finished difference Result 164 states and 482 transitions. [2022-04-18 20:13:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 20:13:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-04-18 20:13:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:29,457 INFO L225 Difference]: With dead ends: 164 [2022-04-18 20:13:29,457 INFO L226 Difference]: Without dead ends: 164 [2022-04-18 20:13:29,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:13:29,458 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 150 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:29,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 12 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-18 20:13:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-18 20:13:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.9753086419753085) internal successors, (482), 163 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 482 transitions. [2022-04-18 20:13:29,464 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 482 transitions. Word has length 13 [2022-04-18 20:13:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:29,465 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 482 transitions. [2022-04-18 20:13:29,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 482 transitions. [2022-04-18 20:13:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:13:29,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:29,466 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:29,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-18 20:13:29,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:29,683 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1072697840, now seen corresponding path program 3 times [2022-04-18 20:13:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:29,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160298261] [2022-04-18 20:13:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:29,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160298261] [2022-04-18 20:13:29,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160298261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705351059] [2022-04-18 20:13:29,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:13:29,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:29,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:29,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:13:29,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 20:13:29,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:13:29,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:13:29,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-18 20:13:29,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:29,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:13:30,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705351059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:30,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593747135] [2022-04-18 20:13:30,052 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:13:30,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:30,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-04-18 20:13:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418238031] [2022-04-18 20:13:30,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:30,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-18 20:13:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-18 20:13:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-04-18 20:13:30,054 INFO L87 Difference]: Start difference. First operand 164 states and 482 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:30,218 INFO L93 Difference]: Finished difference Result 272 states and 806 transitions. [2022-04-18 20:13:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-18 20:13:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-04-18 20:13:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:30,221 INFO L225 Difference]: With dead ends: 272 [2022-04-18 20:13:30,222 INFO L226 Difference]: Without dead ends: 272 [2022-04-18 20:13:30,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-04-18 20:13:30,223 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 399 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:30,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 9 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-18 20:13:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-04-18 20:13:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 2.9851851851851854) internal successors, (806), 271 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 806 transitions. [2022-04-18 20:13:30,257 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 806 transitions. Word has length 19 [2022-04-18 20:13:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:30,257 INFO L478 AbstractCegarLoop]: Abstraction has 272 states and 806 transitions. [2022-04-18 20:13:30,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 806 transitions. [2022-04-18 20:13:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-18 20:13:30,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:30,259 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:30,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:30,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-18 20:13:30,476 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-04-18 20:13:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -989754960, now seen corresponding path program 4 times [2022-04-18 20:13:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:30,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926023037] [2022-04-18 20:13:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 20:13:30,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 20:13:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 20:13:30,573 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-04-18 20:13:30,573 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 20:13:30,574 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-04-18 20:13:30,575 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-04-18 20:13:30,575 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-04-18 20:13:30,575 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-04-18 20:13:30,576 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-04-18 20:13:30,577 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-04-18 20:13:30,578 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-04-18 20:13:30,579 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-04-18 20:13:30,579 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-04-18 20:13:30,579 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-04-18 20:13:30,579 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-04-18 20:13:30,579 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-04-18 20:13:30,580 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-04-18 20:13:30,580 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-04-18 20:13:30,580 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-04-18 20:13:30,580 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-04-18 20:13:30,580 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-04-18 20:13:30,580 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-04-18 20:13:30,581 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-04-18 20:13:30,581 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-04-18 20:13:30,581 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-04-18 20:13:30,582 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-04-18 20:13:30,582 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-04-18 20:13:30,583 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-04-18 20:13:30,583 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-04-18 20:13:30,583 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-04-18 20:13:30,583 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-04-18 20:13:30,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 20:13:30,585 INFO L719 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-04-18 20:13:30,590 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 20:13:30,590 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 20:13:30,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 08:13:30 BasicIcfg [2022-04-18 20:13:30,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 20:13:30,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 20:13:30,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 20:13:30,641 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 20:13:30,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:13:24" (3/4) ... [2022-04-18 20:13:30,643 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 20:13:30,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 20:13:30,644 INFO L158 Benchmark]: Toolchain (without parser) took 6979.42ms. Allocated memory was 104.9MB in the beginning and 243.3MB in the end (delta: 138.4MB). Free memory was 71.5MB in the beginning and 95.3MB in the end (delta: -23.8MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. [2022-04-18 20:13:30,644 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 20:13:30,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.55ms. Allocated memory was 104.9MB in the beginning and 165.7MB in the end (delta: 60.8MB). Free memory was 71.2MB in the beginning and 130.5MB in the end (delta: -59.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 20:13:30,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 165.7MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:13:30,644 INFO L158 Benchmark]: Boogie Preprocessor took 24.95ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:13:30,645 INFO L158 Benchmark]: RCFGBuilder took 506.88ms. Allocated memory is still 165.7MB. Free memory was 126.3MB in the beginning and 108.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-04-18 20:13:30,645 INFO L158 Benchmark]: TraceAbstraction took 6042.78ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 107.4MB in the beginning and 95.3MB in the end (delta: 12.1MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2022-04-18 20:13:30,645 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 243.3MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 20:13:30,646 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.15ms. Allocated memory is still 104.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.55ms. Allocated memory was 104.9MB in the beginning and 165.7MB in the end (delta: 60.8MB). Free memory was 71.2MB in the beginning and 130.5MB in the end (delta: -59.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 165.7MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.95ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.88ms. Allocated memory is still 165.7MB. Free memory was 126.3MB in the beginning and 108.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6042.78ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 107.4MB in the beginning and 95.3MB in the end (delta: 12.1MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 243.3MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 192 PlacesBefore, 53 PlacesAfterwards, 193 TransitionsBefore, 50 TransitionsAfterwards, 13080 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 173 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 235 TotalNumberOfCompositions, 16175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14275, positive: 14153, positive conditional: 0, positive unconditional: 14153, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8408, positive: 8349, positive conditional: 0, positive unconditional: 8349, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8408, positive: 8251, positive conditional: 0, positive unconditional: 8251, negative: 157, negative conditional: 0, negative unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 157, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14275, positive: 5804, positive conditional: 0, positive unconditional: 5804, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 8408, unknown conditional: 0, unknown unconditional: 8408] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; [L686] 0 int p, q; [L703] 0 int cur = 1, prev = 0, next = 0; [L704] 0 int x; [L714] 0 pthread_t id1, id2; [L716] 0 i = 1 [L719] 0 j = 1 [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=28661, arg={0:0}, argc=28661, argv={28659:28660}, argv={28659:28660}, cur=1, i=1, id1={6:0}, id2={7:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2, q=0, x=0] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=28661, arg={0:0}, arg={0:0}, arg={0:0}, argc=28661, argv={28659:28660}, argv={28659:28660}, cur=1, i=1, id1={6:0}, id2={7:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 22 [L706] COND TRUE 0 x < 22 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 22 [L706] COND FALSE 0 !(x < 22) [L711] 0 return prev; [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); [L725] 0 i < correct VAL [\old(argc)=28661, arg={0:0}, arg={0:0}, arg={0:0}, argc=28661, argv={28659:28660}, argv={28659:28660}, correct=17711, cur=28657, i=1, id1={6:0}, id2={7:0}, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L688] 1 p < 10 [L688] COND TRUE 1 p < 10 [L690] EXPR 1 i + j [L690] 1 i = i + j [L688] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=2, j=1, next=28657, p=1, prev=17711, q=0, x=22] [L725] 0 i < correct VAL [\old(argc)=28661, arg={0:0}, arg={0:0}, arg={0:0}, argc=28661, argv={28659:28660}, argv={28659:28660}, correct=17711, cur=28657, i=2, id1={6:0}, id2={7:0}, j=1, next=28657, p=1, prev=17711, q=0, x=22] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i < correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 18 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 573 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1/199 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-18 20:13:30,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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