./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread/indexer.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/indexer.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 f24afaadf07ead7c7da85cf6020fd6a6a5b5585e439441b5111a2dea2e7cec4c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:13:38,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:13:38,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:13:38,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:13:38,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:13:38,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:13:38,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:13:38,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:13:38,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:13:38,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:13:38,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:13:38,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:13:38,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:13:38,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:13:38,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:13:38,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:13:38,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:13:38,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:13:38,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:13:38,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:13:38,724 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:13:38,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:13:38,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:13:38,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:13:38,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:13:38,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:13:38,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:13:38,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:13:38,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:13:38,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:13:38,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:13:38,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:13:38,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:13:38,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:13:38,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:13:38,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:13:38,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:13:38,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:13:38,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:13:38,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:13:38,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:13:38,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:13:38,741 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:38,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:13:38,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:13:38,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:13:38,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:13:38,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:13:38,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:13:38,770 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:13:38,770 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:13:38,770 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:13:38,771 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 20:13:38,771 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:13:38,771 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:13:38,771 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 20:13:38,771 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 20:13:38,772 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:13:38,772 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 20:13:38,772 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 20:13:38,772 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 20:13:38,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:13:38,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:13:38,773 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:13:38,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 20:13:38,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:13:38,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:13:38,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:13:38,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:13:38,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:13:38,774 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:13:38,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:13:38,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:13:38,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:13:38,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:13:38,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:13:38,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:13:38,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:13:38,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:13:38,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:13:38,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:13:38,777 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 20:13:38,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 20:13:38,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:13:38,777 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:13:38,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:13:38,777 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 -> f24afaadf07ead7c7da85cf6020fd6a6a5b5585e439441b5111a2dea2e7cec4c [2022-04-18 20:13:38,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:13:38,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:13:38,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:13:38,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:13:38,995 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:13:38,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread/indexer.i [2022-04-18 20:13:39,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/892f8f527/3746d123f3bf4c4fa2d8866c2ba3756a/FLAG094073e41 [2022-04-18 20:13:39,505 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:13:39,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/indexer.i [2022-04-18 20:13:39,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/892f8f527/3746d123f3bf4c4fa2d8866c2ba3756a/FLAG094073e41 [2022-04-18 20:13:39,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/892f8f527/3746d123f3bf4c4fa2d8866c2ba3756a [2022-04-18 20:13:39,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:13:39,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:13:39,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:13:39,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:13:39,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:13:39,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:13:39" (1/1) ... [2022-04-18 20:13:39,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252eb172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:39, skipping insertion in model container [2022-04-18 20:13:39,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:13:39" (1/1) ... [2022-04-18 20:13:39,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:13:39,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:13:40,214 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/indexer.i[47556,47569] [2022-04-18 20:13:40,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:13:40,301 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:13:40,338 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/indexer.i[47556,47569] [2022-04-18 20:13:40,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:13:40,379 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:13:40,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:40 WrapperNode [2022-04-18 20:13:40,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:13:40,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:13:40,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:13:40,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:13:40,385 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:40" (1/1) ... [2022-04-18 20:13:40,396 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:40" (1/1) ... [2022-04-18 20:13:40,415 INFO L137 Inliner]: procedures = 269, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2022-04-18 20:13:40,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:13:40,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:13:40,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:13:40,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:13:40,423 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:40" (1/1) ... [2022-04-18 20:13:40,423 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:40" (1/1) ... [2022-04-18 20:13:40,426 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:40" (1/1) ... [2022-04-18 20:13:40,427 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:40" (1/1) ... [2022-04-18 20:13:40,433 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:40" (1/1) ... [2022-04-18 20:13:40,436 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:40" (1/1) ... [2022-04-18 20:13:40,437 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:40" (1/1) ... [2022-04-18 20:13:40,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:13:40,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:13:40,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:13:40,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:13:40,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:40" (1/1) ... [2022-04-18 20:13:40,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:13:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:40,478 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:40,484 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:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:13:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:13:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 20:13:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread_routine [2022-04-18 20:13:40,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_routine [2022-04-18 20:13:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 20:13:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-04-18 20:13:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:13:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 20:13:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:13:40,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:13:40,504 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:40,576 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:13:40,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:13:40,797 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:13:40,803 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:13:40,803 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-18 20:13:40,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:13:40 BoogieIcfgContainer [2022-04-18 20:13:40,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:13:40,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:13:40,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:13:40,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:13:40,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:13:39" (1/3) ... [2022-04-18 20:13:40,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7917ef74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:13:40, skipping insertion in model container [2022-04-18 20:13:40,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:13:40" (2/3) ... [2022-04-18 20:13:40,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7917ef74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:13:40, skipping insertion in model container [2022-04-18 20:13:40,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:13:40" (3/3) ... [2022-04-18 20:13:40,810 INFO L111 eAbstractionObserver]: Analyzing ICFG indexer.i [2022-04-18 20:13:40,813 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:13:40,813 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:13:40,814 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-04-18 20:13:40,814 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:13:40,872 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-04-18 20:13:40,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:13:40,909 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:40,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-04-18 20:13:40,919 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:13:40,926 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 155 transitions, 318 flow [2022-04-18 20:13:40,928 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 155 transitions, 318 flow [2022-04-18 20:13:40,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 155 transitions, 318 flow [2022-04-18 20:13:41,022 INFO L129 PetriNetUnfolder]: 18/193 cut-off events. [2022-04-18 20:13:41,032 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 20:13:41,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 193 events. 18/193 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2022-04-18 20:13:41,068 INFO L116 LiptonReduction]: Number of co-enabled transitions 6424 [2022-04-18 20:13:43,173 INFO L131 LiptonReduction]: Checked pairs total: 16230 [2022-04-18 20:13:43,173 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-04-18 20:13:43,179 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 54 transitions, 116 flow [2022-04-18 20:13:43,229 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 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:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 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:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-04-18 20:13:43,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:43,236 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:43,237 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1405006749, now seen corresponding path program 1 times [2022-04-18 20:13:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240432577] [2022-04-18 20:13:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:43,355 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:43,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:43,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240432577] [2022-04-18 20:13:43,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240432577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:13:43,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:13:43,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 20:13:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051371233] [2022-04-18 20:13:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:13:43,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:13:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:13:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:13:43,377 INFO L87 Difference]: Start difference. First operand has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:43,449 INFO L93 Difference]: Finished difference Result 477 states and 948 transitions. [2022-04-18 20:13:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:13:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:43,459 INFO L225 Difference]: With dead ends: 477 [2022-04-18 20:13:43,460 INFO L226 Difference]: Without dead ends: 476 [2022-04-18 20:13:43,460 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:43,462 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:43,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 42 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-04-18 20:13:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-04-18 20:13:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 459 states have (on average 2.0631808278867103) internal successors, (947), 475 states have internal predecessors, (947), 0 states have call successors, (0), 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:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 947 transitions. [2022-04-18 20:13:43,503 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 947 transitions. Word has length 8 [2022-04-18 20:13:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:43,503 INFO L478 AbstractCegarLoop]: Abstraction has 476 states and 947 transitions. [2022-04-18 20:13:43,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 947 transitions. [2022-04-18 20:13:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-18 20:13:43,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:43,504 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:43,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 20:13:43,505 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 14681187, now seen corresponding path program 1 times [2022-04-18 20:13:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:43,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456207910] [2022-04-18 20:13:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:43,553 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:43,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:43,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456207910] [2022-04-18 20:13:43,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456207910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:43,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947473141] [2022-04-18 20:13:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:43,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:43,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:43,560 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:43,578 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:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:43,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 20:13:43,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:43,664 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:43,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:43,680 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:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947473141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:43,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [730034413] [2022-04-18 20:13:43,687 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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:43,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:43,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-04-18 20:13:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486293044] [2022-04-18 20:13:43,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:43,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 20:13:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 20:13:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:13:43,701 INFO L87 Difference]: Start difference. First operand 476 states and 947 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:43,737 INFO L93 Difference]: Finished difference Result 279 states and 542 transitions. [2022-04-18 20:13:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:13:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-04-18 20:13:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:43,738 INFO L225 Difference]: With dead ends: 279 [2022-04-18 20:13:43,739 INFO L226 Difference]: Without dead ends: 279 [2022-04-18 20:13:43,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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:43,740 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 210 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:43,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 42 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-04-18 20:13:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-04-18 20:13:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 270 states have (on average 2.0074074074074075) internal successors, (542), 278 states have internal predecessors, (542), 0 states have call successors, (0), 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:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 542 transitions. [2022-04-18 20:13:43,755 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 542 transitions. Word has length 9 [2022-04-18 20:13:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:43,768 INFO L478 AbstractCegarLoop]: Abstraction has 279 states and 542 transitions. [2022-04-18 20:13:43,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 542 transitions. [2022-04-18 20:13:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-18 20:13:43,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:43,769 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:43,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-18 20:13:43,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:43,986 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 976178275, now seen corresponding path program 2 times [2022-04-18 20:13:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:43,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302797927] [2022-04-18 20:13:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:44,053 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:44,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:44,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302797927] [2022-04-18 20:13:44,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302797927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:44,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341002385] [2022-04-18 20:13:44,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:13:44,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:44,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:44,060 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:44,063 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:44,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:13:44,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:13:44,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-18 20:13:44,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:44,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:13:44,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 20:13:44,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:13:44,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:13:44,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:13:44,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:13:44,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:13:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-18 20:13:44,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:13:44,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341002385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:13:44,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:13:44,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2022-04-18 20:13:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237810214] [2022-04-18 20:13:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:13:44,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 20:13:44,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 20:13:44,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:13:44,254 INFO L87 Difference]: Start difference. First operand 279 states and 542 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:44,463 INFO L93 Difference]: Finished difference Result 364 states and 721 transitions. [2022-04-18 20:13:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:13:44,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-04-18 20:13:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:44,466 INFO L225 Difference]: With dead ends: 364 [2022-04-18 20:13:44,466 INFO L226 Difference]: Without dead ends: 364 [2022-04-18 20:13:44,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:13:44,467 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:44,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 17 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:13:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-18 20:13:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-18 20:13:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 356 states have (on average 2.0252808988764044) internal successors, (721), 363 states have internal predecessors, (721), 0 states have call successors, (0), 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:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 721 transitions. [2022-04-18 20:13:44,477 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 721 transitions. Word has length 12 [2022-04-18 20:13:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:44,477 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 721 transitions. [2022-04-18 20:13:44,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 721 transitions. [2022-04-18 20:13:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:13:44,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:44,478 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:44,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:44,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:44,695 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread_routineErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1181059327, now seen corresponding path program 1 times [2022-04-18 20:13:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:44,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852615738] [2022-04-18 20:13:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:44,745 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:44,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852615738] [2022-04-18 20:13:44,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852615738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152937452] [2022-04-18 20:13:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:44,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:44,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:44,747 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:44,780 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:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:44,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 20:13:44,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:44,885 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:44,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:44,942 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:44,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152937452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:44,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [561646166] [2022-04-18 20:13:44,943 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:44,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:44,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-04-18 20:13:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574586031] [2022-04-18 20:13:44,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:44,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-18 20:13:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-18 20:13:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:13:44,948 INFO L87 Difference]: Start difference. First operand 364 states and 721 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:44,987 INFO L93 Difference]: Finished difference Result 370 states and 727 transitions. [2022-04-18 20:13:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 20:13:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-04-18 20:13:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:44,989 INFO L225 Difference]: With dead ends: 370 [2022-04-18 20:13:44,989 INFO L226 Difference]: Without dead ends: 370 [2022-04-18 20:13:44,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 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:44,991 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 104 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:44,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 63 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-04-18 20:13:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-04-18 20:13:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 362 states have (on average 2.0082872928176796) internal successors, (727), 369 states have internal predecessors, (727), 0 states have call successors, (0), 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:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 727 transitions. [2022-04-18 20:13:45,003 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 727 transitions. Word has length 20 [2022-04-18 20:13:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:45,004 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 727 transitions. [2022-04-18 20:13:45,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 727 transitions. [2022-04-18 20:13:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-18 20:13:45,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:45,005 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:45,040 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:45,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:45,223 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread_routineErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -664832255, now seen corresponding path program 2 times [2022-04-18 20:13:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:45,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496163499] [2022-04-18 20:13:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:45,354 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:45,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:45,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496163499] [2022-04-18 20:13:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496163499] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216351102] [2022-04-18 20:13:45,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:13:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:45,360 INFO L229 MonitoredProcess]: Starting monitored process 5 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:45,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 20:13:45,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:13:45,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:13:45,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-18 20:13:45,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:45,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:13:45,487 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-18 20:13:45,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 20:13:45,513 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-04-18 20:13:45,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:13:45,548 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-18 20:13:45,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:13:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-18 20:13:45,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:13:45,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216351102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:13:45,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:13:45,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2022-04-18 20:13:45,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492323270] [2022-04-18 20:13:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:13:45,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:13:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:45,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:13:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-18 20:13:45,576 INFO L87 Difference]: Start difference. First operand 370 states and 727 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:45,708 INFO L93 Difference]: Finished difference Result 546 states and 1085 transitions. [2022-04-18 20:13:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:13:45,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-04-18 20:13:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:45,710 INFO L225 Difference]: With dead ends: 546 [2022-04-18 20:13:45,710 INFO L226 Difference]: Without dead ends: 546 [2022-04-18 20:13:45,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-18 20:13:45,711 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:45,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 22 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-04-18 20:13:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 398. [2022-04-18 20:13:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.9974358974358974) internal successors, (779), 397 states have internal predecessors, (779), 0 states have call successors, (0), 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:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 779 transitions. [2022-04-18 20:13:45,719 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 779 transitions. Word has length 26 [2022-04-18 20:13:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:45,719 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 779 transitions. [2022-04-18 20:13:45,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 779 transitions. [2022-04-18 20:13:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-18 20:13:45,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:45,720 INFO L499 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:45,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:45,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:45,937 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 293388359, now seen corresponding path program 1 times [2022-04-18 20:13:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:45,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826789361] [2022-04-18 20:13:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:46,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826789361] [2022-04-18 20:13:46,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826789361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:46,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068708420] [2022-04-18 20:13:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:46,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:46,056 INFO L229 MonitoredProcess]: Starting monitored process 6 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:46,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 20:13:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:46,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-18 20:13:46,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:46,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:46,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068708420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:46,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1771277678] [2022-04-18 20:13:46,375 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:46,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:46,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-04-18 20:13:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189216895] [2022-04-18 20:13:46,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:46,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-18 20:13:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-18 20:13:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-04-18 20:13:46,376 INFO L87 Difference]: Start difference. First operand 398 states and 779 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:46,425 INFO L93 Difference]: Finished difference Result 410 states and 791 transitions. [2022-04-18 20:13:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-18 20:13:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-04-18 20:13:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:46,427 INFO L225 Difference]: With dead ends: 410 [2022-04-18 20:13:46,427 INFO L226 Difference]: Without dead ends: 410 [2022-04-18 20:13:46,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 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:46,428 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 204 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:46,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 42 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-18 20:13:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-18 20:13:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-04-18 20:13:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 402 states have (on average 1.9676616915422886) internal successors, (791), 409 states have internal predecessors, (791), 0 states have call successors, (0), 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:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 791 transitions. [2022-04-18 20:13:46,434 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 791 transitions. Word has length 29 [2022-04-18 20:13:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:46,434 INFO L478 AbstractCegarLoop]: Abstraction has 410 states and 791 transitions. [2022-04-18 20:13:46,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:13:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 791 transitions. [2022-04-18 20:13:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-18 20:13:46,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:46,435 INFO L499 BasicCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:46,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:46,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:46,652 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1628258233, now seen corresponding path program 2 times [2022-04-18 20:13:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:46,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274387310] [2022-04-18 20:13:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:47,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:47,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274387310] [2022-04-18 20:13:47,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274387310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:47,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083797943] [2022-04-18 20:13:47,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:13:47,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:47,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:47,037 INFO L229 MonitoredProcess]: Starting monitored process 7 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:47,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 20:13:49,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-18 20:13:49,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:13:49,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-18 20:13:49,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:49,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:50,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083797943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:50,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [373230852] [2022-04-18 20:13:50,227 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:50,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:50,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-04-18 20:13:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641497447] [2022-04-18 20:13:50,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:50,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-18 20:13:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-18 20:13:50,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-04-18 20:13:50,230 INFO L87 Difference]: Start difference. First operand 410 states and 791 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:50,313 INFO L93 Difference]: Finished difference Result 434 states and 815 transitions. [2022-04-18 20:13:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-18 20:13:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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 41 [2022-04-18 20:13:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:50,315 INFO L225 Difference]: With dead ends: 434 [2022-04-18 20:13:50,315 INFO L226 Difference]: Without dead ends: 434 [2022-04-18 20:13:50,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-04-18 20:13:50,316 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 305 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:50,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 42 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-18 20:13:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-18 20:13:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 426 states have (on average 1.9131455399061033) internal successors, (815), 433 states have internal predecessors, (815), 0 states have call successors, (0), 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:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 815 transitions. [2022-04-18 20:13:50,323 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 815 transitions. Word has length 41 [2022-04-18 20:13:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:50,323 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 815 transitions. [2022-04-18 20:13:50,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 815 transitions. [2022-04-18 20:13:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-18 20:13:50,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:50,325 INFO L499 BasicCegarLoop]: trace histogram [46, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:50,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:50,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:50,545 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1226915769, now seen corresponding path program 3 times [2022-04-18 20:13:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:50,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907689344] [2022-04-18 20:13:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:51,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907689344] [2022-04-18 20:13:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907689344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035605891] [2022-04-18 20:13:51,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:13:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:51,420 INFO L229 MonitoredProcess]: Starting monitored process 8 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:51,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 20:13:51,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:13:51,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:13:51,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:13:51,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:51,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:53,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035605891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111774859] [2022-04-18 20:13:53,328 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:53,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:53,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2022-04-18 20:13:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867823108] [2022-04-18 20:13:53,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:53,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-18 20:13:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:53,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-18 20:13:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-04-18 20:13:53,333 INFO L87 Difference]: Start difference. First operand 434 states and 815 transitions. Second operand has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 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:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:53,482 INFO L93 Difference]: Finished difference Result 482 states and 863 transitions. [2022-04-18 20:13:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-04-18 20:13:53,483 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 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 65 [2022-04-18 20:13:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:53,486 INFO L225 Difference]: With dead ends: 482 [2022-04-18 20:13:53,486 INFO L226 Difference]: Without dead ends: 482 [2022-04-18 20:13:53,488 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-04-18 20:13:53,489 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 544 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:53,489 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 63 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-18 20:13:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-04-18 20:13:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 474 states have (on average 1.8206751054852321) internal successors, (863), 481 states have internal predecessors, (863), 0 states have call successors, (0), 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:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 863 transitions. [2022-04-18 20:13:53,503 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 863 transitions. Word has length 65 [2022-04-18 20:13:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:53,504 INFO L478 AbstractCegarLoop]: Abstraction has 482 states and 863 transitions. [2022-04-18 20:13:53,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 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:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 863 transitions. [2022-04-18 20:13:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-18 20:13:53,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:53,507 INFO L499 BasicCegarLoop]: trace histogram [94, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:53,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:53,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-18 20:13:53,719 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash -625557433, now seen corresponding path program 4 times [2022-04-18 20:13:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183753459] [2022-04-18 20:13:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:55,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:13:55,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183753459] [2022-04-18 20:13:55,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183753459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:13:55,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157216907] [2022-04-18 20:13:55,555 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:13:55,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:13:55,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:13:55,556 INFO L229 MonitoredProcess]: Starting monitored process 9 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:55,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-18 20:13:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:13:55,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-18 20:13:55,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:13:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:55,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:13:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:13:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157216907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:13:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826874947] [2022-04-18 20:13:57,876 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:57,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:13:57,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 130 [2022-04-18 20:13:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446272299] [2022-04-18 20:13:57,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:13:57,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-04-18 20:13:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:13:57,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-04-18 20:13:57,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2022-04-18 20:13:57,899 INFO L87 Difference]: Start difference. First operand 482 states and 863 transitions. Second operand has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:13:58,085 INFO L93 Difference]: Finished difference Result 516 states and 897 transitions. [2022-04-18 20:13:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 20:13:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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 113 [2022-04-18 20:13:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:13:58,089 INFO L225 Difference]: With dead ends: 516 [2022-04-18 20:13:58,089 INFO L226 Difference]: Without dead ends: 516 [2022-04-18 20:13:58,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2022-04-18 20:13:58,093 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 581 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:13:58,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 42 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:13:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-04-18 20:13:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2022-04-18 20:13:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.765748031496063) internal successors, (897), 515 states have internal predecessors, (897), 0 states have call successors, (0), 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:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 897 transitions. [2022-04-18 20:13:58,103 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 897 transitions. Word has length 113 [2022-04-18 20:13:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:13:58,104 INFO L478 AbstractCegarLoop]: Abstraction has 516 states and 897 transitions. [2022-04-18 20:13:58,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 897 transitions. [2022-04-18 20:13:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-18 20:13:58,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:13:58,106 INFO L499 BasicCegarLoop]: trace histogram [128, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:13:58,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-18 20:13:58,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-18 20:13:58,320 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-04-18 20:13:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:13:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 189775943, now seen corresponding path program 5 times [2022-04-18 20:13:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:13:58,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835927605] [2022-04-18 20:13:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:13:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:13:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 20:13:58,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 20:13:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 20:13:58,638 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-04-18 20:13:58,638 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 20:13:58,639 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-04-18 20:13:58,640 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-04-18 20:13:58,641 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr2ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-04-18 20:13:58,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 20:13:58,642 INFO L719 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1] [2022-04-18 20:13:58,647 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 20:13:58,647 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 20:13:58,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 08:13:58 BasicIcfg [2022-04-18 20:13:58,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 20:13:58,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 20:13:58,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 20:13:58,742 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 20:13:58,743 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:40" (3/4) ... [2022-04-18 20:13:58,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 20:13:58,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 20:13:58,745 INFO L158 Benchmark]: Toolchain (without parser) took 18837.47ms. Allocated memory was 111.1MB in the beginning and 262.1MB in the end (delta: 151.0MB). Free memory was 72.3MB in the beginning and 149.0MB in the end (delta: -76.6MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2022-04-18 20:13:58,745 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 20:13:58,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.86ms. Allocated memory is still 111.1MB. Free memory was 72.1MB in the beginning and 72.2MB in the end (delta: -131.5kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-04-18 20:13:58,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.25ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 69.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:13:58,745 INFO L158 Benchmark]: Boogie Preprocessor took 22.86ms. Allocated memory is still 111.1MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:13:58,746 INFO L158 Benchmark]: RCFGBuilder took 364.94ms. Allocated memory is still 111.1MB. Free memory was 67.0MB in the beginning and 49.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-04-18 20:13:58,746 INFO L158 Benchmark]: TraceAbstraction took 17936.39ms. Allocated memory was 111.1MB in the beginning and 262.1MB in the end (delta: 151.0MB). Free memory was 49.6MB in the beginning and 149.0MB in the end (delta: -99.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2022-04-18 20:13:58,746 INFO L158 Benchmark]: Witness Printer took 2.24ms. Allocated memory is still 262.1MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 20:13:58,747 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 111.1MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.86ms. Allocated memory is still 111.1MB. Free memory was 72.1MB in the beginning and 72.2MB in the end (delta: -131.5kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.25ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 69.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.86ms. Allocated memory is still 111.1MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.94ms. Allocated memory is still 111.1MB. Free memory was 67.0MB in the beginning and 49.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17936.39ms. Allocated memory was 111.1MB in the beginning and 262.1MB in the end (delta: 151.0MB). Free memory was 49.6MB in the beginning and 149.0MB in the end (delta: -99.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 2.24ms. Allocated memory is still 262.1MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 144 PlacesBefore, 50 PlacesAfterwards, 155 TransitionsBefore, 54 TransitionsAfterwards, 6424 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 114 TotalNumberOfCompositions, 16230 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5601, positive: 5203, positive conditional: 0, positive unconditional: 5203, negative: 398, negative conditional: 0, negative unconditional: 398, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3785, positive: 3656, positive conditional: 0, positive unconditional: 3656, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3785, positive: 3582, positive conditional: 0, positive unconditional: 3582, negative: 203, negative conditional: 0, negative unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 311, positive: 114, positive conditional: 0, positive unconditional: 114, negative: 197, negative conditional: 0, negative unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5601, positive: 1547, positive conditional: 0, positive unconditional: 1547, negative: 269, negative conditional: 0, negative unconditional: 269, unknown: 3785, unknown conditional: 0, unknown unconditional: 3785] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 365, Positive conditional cache size: 0, Positive unconditional cache size: 365, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85 - 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: 1043]: Data race detected Data race detected The following path leads to a data race: [L1000] 0 int table[128]; [L1001] 0 pthread_mutex_t cas_mutex[128]; [L1002] 0 pthread_t tids[13]; [L1039] 0 int i, arg; [L1040] 0 i = 0 VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=2, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=3, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=4, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=5, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=6, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=7, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=8, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=9, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=10, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=11, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=12, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=13, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=14, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=15, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=16, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=17, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=18, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=19, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=20, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=21, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=22, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=23, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=24, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=25, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=26, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=27, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=28, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=29, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=30, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=31, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=32, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=33, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=34, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=35, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=36, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=37, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=38, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=39, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=40, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=41, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=42, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=43, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=44, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=45, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=46, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=47, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=48, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=49, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=50, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=51, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=52, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=53, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=54, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=55, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=56, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=57, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=58, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=59, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=60, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=61, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=62, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=63, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=64, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=65, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=66, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=67, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=68, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=69, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=70, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=71, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=72, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=73, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=74, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=75, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=76, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=77, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=78, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=79, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=80, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=81, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=82, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=83, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=84, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=85, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=86, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=87, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=88, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=89, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=90, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=91, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=92, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=93, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=94, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=95, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=96, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=97, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=98, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=99, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=100, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=101, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=102, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=103, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=104, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=105, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=106, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=107, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=108, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=109, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=110, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=111, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=112, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=113, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=114, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=115, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=116, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=117, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=118, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=119, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=120, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=121, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=122, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=123, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=124, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=125, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=126, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=127, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=128, table={3:0}, tids={5:0}] [L1040] COND FALSE 0 !(i < 128) [L1042] 0 i = 0 VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={3:0}, tids={5:0}] [L1042] COND TRUE 0 i < 13 [L1043] 0 arg=i VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={3:0}, tids={5:0}] [L1044] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), thread_routine, &arg) VAL [arg={6:0}, cas_mutex={4:0}, i=0, pthread_create(&tids[i], ((void *)0), thread_routine, &arg)=-1, table={3:0}, tids={5:0}] [L1016] 1 int tid; [L1017] 1 int m = 0, w, h; [L1018] EXPR 1 \read(*arg) VAL [\read(*arg)=0, arg={6:0}, arg={6:0}, cas_mutex={4:0}, m=0, table={3:0}, tids={5:0}] [L1042] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] [L1042] COND TRUE 0 i < 13 [L1043] 0 arg=i VAL [arg={6:0}, arg=i=3074, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] [L1018] 1 tid = *((int *)arg) VAL [\read(*arg)=0, arg={6:0}, arg={6:0}, cas_mutex={4:0}, m=0, table={3:0}, tids={5:0}] [L1043] 0 arg=i VAL [arg={6:0}, arg=i=3074, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] Now there is a data race (on the heap) between C: tid = *((int *)arg) [1018] and C: arg=i [1043] - UnprovableResult [Line: 1018]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1044]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 10, TraceHistogramMax: 128, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2127 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2127 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 179 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 450 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=0, InterpolantAutomatonStates: 332, 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, 9 MinimizatonAttempts, 148 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 785 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 2213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2255 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 137/17797 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:58,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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