./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/floating_read-5.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-deagle/floating_read-5.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 2f28efd84e1dbcbcea7683bca483f8f3b9fbdd333eb36f517b9f12d5bccb885d
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-efd9311-m
[2022-04-18 18:52:46,381 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-18 18:52:46,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-18 18:52:46,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-18 18:52:46,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-18 18:52:46,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-18 18:52:46,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-18 18:52:46,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-18 18:52:46,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-18 18:52:46,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-18 18:52:46,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-18 18:52:46,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-18 18:52:46,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-18 18:52:46,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-18 18:52:46,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-18 18:52:46,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-18 18:52:46,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-18 18:52:46,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-18 18:52:46,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-18 18:52:46,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-18 18:52:46,455 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-18 18:52:46,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-18 18:52:46,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-18 18:52:46,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-18 18:52:46,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-18 18:52:46,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-18 18:52:46,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-18 18:52:46,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-18 18:52:46,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-18 18:52:46,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-18 18:52:46,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-18 18:52:46,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-18 18:52:46,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-18 18:52:46,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-18 18:52:46,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-18 18:52:46,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-18 18:52:46,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-18 18:52:46,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-18 18:52:46,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-18 18:52:46,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-18 18:52:46,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-18 18:52:46,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-18 18:52:46,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf
[2022-04-18 18:52:46,513 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-18 18:52:46,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-18 18:52:46,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-04-18 18:52:46,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-04-18 18:52:46,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-04-18 18:52:46,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-04-18 18:52:46,515 INFO L138 SettingsManager]: * User list type=DISABLED
[2022-04-18 18:52:46,516 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2022-04-18 18:52:46,516 INFO L138 SettingsManager]: * Explicit value domain=true
[2022-04-18 18:52:46,516 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2022-04-18 18:52:46,517 INFO L138 SettingsManager]: * Octagon Domain=false
[2022-04-18 18:52:46,517 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain
[2022-04-18 18:52:46,517 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true
[2022-04-18 18:52:46,517 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2022-04-18 18:52:46,517 INFO L138 SettingsManager]: * Interval Domain=false
[2022-04-18 18:52:46,519 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults:
[2022-04-18 18:52:46,519 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer
[2022-04-18 18:52:46,519 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC
[2022-04-18 18:52:46,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-18 18:52:46,520 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-18 18:52:46,520 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2022-04-18 18:52:46,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-18 18:52:46,521 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-18 18:52:46,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-18 18:52:46,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-18 18:52:46,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-18 18:52:46,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-18 18:52:46,522 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true
[2022-04-18 18:52:46,522 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-18 18:52:46,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-18 18:52:46,522 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-18 18:52:46,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-18 18:52:46,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-18 18:52:46,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-18 18:52:46,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-18 18:52:46,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-18 18:52:46,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-04-18 18:52:46,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-04-18 18:52:46,524 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN
[2022-04-18 18:52:46,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-04-18 18:52:46,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-18 18:52:46,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2022-04-18 18:52:46,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-04-18 18:52:46,525 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 -> 2f28efd84e1dbcbcea7683bca483f8f3b9fbdd333eb36f517b9f12d5bccb885d
[2022-04-18 18:52:46,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-18 18:52:46,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-18 18:52:46,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-18 18:52:46,795 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-18 18:52:46,795 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-18 18:52:46,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/floating_read-5.i
[2022-04-18 18:52:46,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/624262c94/7a279cfc07714c369545fcedfb60ff9e/FLAG2076511eb
[2022-04-18 18:52:47,334 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-18 18:52:47,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/floating_read-5.i
[2022-04-18 18:52:47,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/624262c94/7a279cfc07714c369545fcedfb60ff9e/FLAG2076511eb
[2022-04-18 18:52:47,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/624262c94/7a279cfc07714c369545fcedfb60ff9e
[2022-04-18 18:52:47,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-18 18:52:47,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-04-18 18:52:47,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-18 18:52:47,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-18 18:52:47,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-18 18:52:47,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 06:52:47" (1/1) ...
[2022-04-18 18:52:47,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2aa5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:47, skipping insertion in model container
[2022-04-18 18:52:47,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 06:52:47" (1/1) ...
[2022-04-18 18:52:47,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-18 18:52:47,710 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-18 18:52:47,972 WARN L1550 CHandler]: Possible shadowing of function thread
[2022-04-18 18:52:47,988 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-deagle/floating_read-5.i[31193,31206]
[2022-04-18 18:52:47,993 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-18 18:52:47,999 INFO L203 MainTranslator]: Completed pre-run
[2022-04-18 18:52:48,038 WARN L1550 CHandler]: Possible shadowing of function thread
[2022-04-18 18:52:48,045 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-deagle/floating_read-5.i[31193,31206]
[2022-04-18 18:52:48,054 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-18 18:52:48,083 INFO L208 MainTranslator]: Completed translation
[2022-04-18 18:52:48,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48 WrapperNode
[2022-04-18 18:52:48,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-18 18:52:48,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-04-18 18:52:48,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-04-18 18:52:48,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-04-18 18:52:48,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,143 INFO L137 Inliner]: procedures = 162, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63
[2022-04-18 18:52:48,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-04-18 18:52:48,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-18 18:52:48,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-18 18:52:48,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-18 18:52:48,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-18 18:52:48,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-18 18:52:48,185 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-18 18:52:48,185 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-18 18:52:48,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (1/1) ...
[2022-04-18 18:52:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-18 18:52:48,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:48,219 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 18:52:48,221 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 18:52:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-18 18:52:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-18 18:52:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-04-18 18:52:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-18 18:52:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-04-18 18:52:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-18 18:52:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-18 18:52:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread
[2022-04-18 18:52:48,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread
[2022-04-18 18:52:48,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-04-18 18:52:48,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-18 18:52:48,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-18 18:52:48,250 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 18:52:48,337 INFO L234 CfgBuilder]: Building ICFG
[2022-04-18 18:52:48,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-18 18:52:48,558 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-18 18:52:48,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-18 18:52:48,588 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-04-18 18:52:48,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:52:48 BoogieIcfgContainer
[2022-04-18 18:52:48,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-18 18:52:48,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-18 18:52:48,593 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-18 18:52:48,596 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-18 18:52:48,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 06:52:47" (1/3) ...
[2022-04-18 18:52:48,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c296d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 06:52:48, skipping insertion in model container
[2022-04-18 18:52:48,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:52:48" (2/3) ...
[2022-04-18 18:52:48,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c296d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 06:52:48, skipping insertion in model container
[2022-04-18 18:52:48,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:52:48" (3/3) ...
[2022-04-18 18:52:48,599 INFO L111 eAbstractionObserver]: Analyzing ICFG floating_read-5.i
[2022-04-18 18:52:48,604 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-04-18 18:52:48,604 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-04-18 18:52:48,604 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2022-04-18 18:52:48,604 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-04-18 18:52:48,661 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2022-04-18 18:52:48,716 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-18 18:52:48,723 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 18:52:48,723 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2022-04-18 18:52:48,736 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-04-18 18:52:48,746 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 69 transitions, 146 flow
[2022-04-18 18:52:48,749 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 69 transitions, 146 flow
[2022-04-18 18:52:48,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 69 transitions, 146 flow
[2022-04-18 18:52:48,800 INFO L129 PetriNetUnfolder]: 7/99 cut-off events.
[2022-04-18 18:52:48,801 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2022-04-18 18:52:48,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 99 events. 7/99 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place.
[2022-04-18 18:52:48,808 INFO L116 LiptonReduction]: Number of co-enabled transitions 432
[2022-04-18 18:52:50,665 INFO L131 LiptonReduction]: Checked pairs total: 465
[2022-04-18 18:52:50,665 INFO L133 LiptonReduction]: Total number of compositions: 63
[2022-04-18 18:52:50,672 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 17 transitions, 42 flow
[2022-04-18 18:52:50,683 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 44 states, 31 states have (on average 2.064516129032258) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 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 18:52:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 31 states have (on average 2.064516129032258) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 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 18:52:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-04-18 18:52:50,688 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:50,689 INFO L499 BasicCegarLoop]: trace histogram [1]
[2022-04-18 18:52:50,689 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] ===
[2022-04-18 18:52:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash 281, now seen corresponding path program 1 times
[2022-04-18 18:52:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556607794]
[2022-04-18 18:52:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:50,784 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 18:52:50,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:50,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556607794]
[2022-04-18 18:52:50,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556607794] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:50,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:50,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-04-18 18:52:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254921159]
[2022-04-18 18:52:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:50,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-18 18:52:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-18 18:52:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:50,810 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 2.064516129032258) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:50,838 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions.
[2022-04-18 18:52:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-18 18:52:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1
[2022-04-18 18:52:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:50,846 INFO L225 Difference]: With dead ends: 29
[2022-04-18 18:52:50,846 INFO L226 Difference]: Without dead ends: 17
[2022-04-18 18:52:50,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:50,851 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:50,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2022-04-18 18:52:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2022-04-18 18:52:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions.
[2022-04-18 18:52:50,876 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 1
[2022-04-18 18:52:50,876 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:50,876 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions.
[2022-04-18 18:52:50,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions.
[2022-04-18 18:52:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2022-04-18 18:52:50,878 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:50,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1]
[2022-04-18 18:52:50,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-18 18:52:50,878 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] ===
[2022-04-18 18:52:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 275971, now seen corresponding path program 1 times
[2022-04-18 18:52:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015411154]
[2022-04-18 18:52:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:50,995 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 18:52:50,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:50,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015411154]
[2022-04-18 18:52:50,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015411154] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:50,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:50,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-18 18:52:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479920830]
[2022-04-18 18:52:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:51,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-18 18:52:51,006 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:51,021 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions.
[2022-04-18 18:52:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:51,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2022-04-18 18:52:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:51,022 INFO L225 Difference]: With dead ends: 15
[2022-04-18 18:52:51,022 INFO L226 Difference]: Without dead ends: 15
[2022-04-18 18:52:51,023 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 18:52:51,024 INFO L913 BasicCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:51,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 4 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2022-04-18 18:52:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2022-04-18 18:52:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions.
[2022-04-18 18:52:51,032 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 3
[2022-04-18 18:52:51,032 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:51,032 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions.
[2022-04-18 18:52:51,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions.
[2022-04-18 18:52:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2022-04-18 18:52:51,033 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:51,034 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1]
[2022-04-18 18:52:51,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-18 18:52:51,034 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] ===
[2022-04-18 18:52:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -361125674, now seen corresponding path program 1 times
[2022-04-18 18:52:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:51,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174898814]
[2022-04-18 18:52:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:51,069 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-18 18:52:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:51,119 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2022-04-18 18:52:51,119 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-18 18:52:51,122 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2022-04-18 18:52:51,124 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2022-04-18 18:52:51,124 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2022-04-18 18:52:51,124 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2022-04-18 18:52:51,124 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2022-04-18 18:52:51,124 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2022-04-18 18:52:51,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-18 18:52:51,126 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2022-04-18 18:52:51,129 WARN L232 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-04-18 18:52:51,129 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2022-04-18 18:52:51,147 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2022-04-18 18:52:51,150 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-18 18:52:51,151 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 18:52:51,151 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2022-04-18 18:52:51,154 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-04-18 18:52:51,154 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 77 transitions, 172 flow
[2022-04-18 18:52:51,154 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 77 transitions, 172 flow
[2022-04-18 18:52:51,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 172 flow
[2022-04-18 18:52:51,202 INFO L129 PetriNetUnfolder]: 13/168 cut-off events.
[2022-04-18 18:52:51,203 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2022-04-18 18:52:51,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 168 events. 13/168 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 331 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place.
[2022-04-18 18:52:51,206 INFO L116 LiptonReduction]: Number of co-enabled transitions 1068
[2022-04-18 18:52:52,757 INFO L131 LiptonReduction]: Checked pairs total: 1560
[2022-04-18 18:52:52,757 INFO L133 LiptonReduction]: Total number of compositions: 68
[2022-04-18 18:52:52,758 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions, 64 flow
[2022-04-18 18:52:52,770 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 177 states, 144 states have (on average 2.4652777777777777) internal successors, (355), 176 states have internal predecessors, (355), 0 states have call successors, (0), 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 18:52:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 144 states have (on average 2.4652777777777777) internal successors, (355), 176 states have internal predecessors, (355), 0 states have call successors, (0), 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 18:52:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-04-18 18:52:52,775 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:52,775 INFO L499 BasicCegarLoop]: trace histogram [1]
[2022-04-18 18:52:52,775 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2022-04-18 18:52:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash 434, now seen corresponding path program 1 times
[2022-04-18 18:52:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:52,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947197957]
[2022-04-18 18:52:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:52,784 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 18:52:52,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:52,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947197957]
[2022-04-18 18:52:52,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947197957] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:52,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:52,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-04-18 18:52:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111222530]
[2022-04-18 18:52:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:52,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-18 18:52:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:52,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-18 18:52:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:52,786 INFO L87 Difference]: Start difference. First operand has 177 states, 144 states have (on average 2.4652777777777777) internal successors, (355), 176 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:52,816 INFO L93 Difference]: Finished difference Result 88 states and 149 transitions.
[2022-04-18 18:52:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-18 18:52:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1
[2022-04-18 18:52:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:52,818 INFO L225 Difference]: With dead ends: 88
[2022-04-18 18:52:52,818 INFO L226 Difference]: Without dead ends: 45
[2022-04-18 18:52:52,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:52,830 INFO L913 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:52,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2022-04-18 18:52:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2022-04-18 18:52:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.829268292682927) internal successors, (75), 44 states have internal predecessors, (75), 0 states have call successors, (0), 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 18:52:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions.
[2022-04-18 18:52:52,835 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 1
[2022-04-18 18:52:52,835 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:52,836 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions.
[2022-04-18 18:52:52,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions.
[2022-04-18 18:52:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2022-04-18 18:52:52,836 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:52,836 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1]
[2022-04-18 18:52:52,837 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-18 18:52:52,837 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2022-04-18 18:52:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash 427732, now seen corresponding path program 1 times
[2022-04-18 18:52:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:52,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971034290]
[2022-04-18 18:52:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:52,858 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 18:52:52,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:52,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971034290]
[2022-04-18 18:52:52,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971034290] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:52,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:52,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-18 18:52:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954233464]
[2022-04-18 18:52:52,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:52,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:52,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-18 18:52:52,861 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:52,872 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions.
[2022-04-18 18:52:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2022-04-18 18:52:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:52,874 INFO L225 Difference]: With dead ends: 43
[2022-04-18 18:52:52,874 INFO L226 Difference]: Without dead ends: 43
[2022-04-18 18:52:52,874 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 18:52:52,875 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:52,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 6 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2022-04-18 18:52:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2022-04-18 18:52:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.825) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 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 18:52:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions.
[2022-04-18 18:52:52,880 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 3
[2022-04-18 18:52:52,880 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:52,880 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions.
[2022-04-18 18:52:52,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions.
[2022-04-18 18:52:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2022-04-18 18:52:52,881 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:52,881 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:52,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-04-18 18:52:52,881 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2022-04-18 18:52:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 547952092, now seen corresponding path program 1 times
[2022-04-18 18:52:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:52,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923506892]
[2022-04-18 18:52:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:52,910 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 18:52:52,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923506892]
[2022-04-18 18:52:52,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923506892] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:52:52,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158246955]
[2022-04-18 18:52:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:52,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:52,912 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 18:52:52,918 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 18:52:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:52,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:52:52,977 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:52:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-18 18:52:53,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-18 18:52:53,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158246955] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:53,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-18 18:52:53,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5
[2022-04-18 18:52:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241401985]
[2022-04-18 18:52:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:53,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:52:53,017 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:53,047 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions.
[2022-04-18 18:52:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2022-04-18 18:52:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:53,049 INFO L225 Difference]: With dead ends: 45
[2022-04-18 18:52:53,049 INFO L226 Difference]: Without dead ends: 43
[2022-04-18 18:52:53,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:52:53,050 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:53,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2022-04-18 18:52:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2022-04-18 18:52:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.7) internal successors, (68), 42 states have internal predecessors, (68), 0 states have call successors, (0), 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 18:52:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions.
[2022-04-18 18:52:53,054 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 7
[2022-04-18 18:52:53,054 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:53,054 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions.
[2022-04-18 18:52:53,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions.
[2022-04-18 18:52:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2022-04-18 18:52:53,055 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:53,055 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:53,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-18 18:52:53,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2022-04-18 18:52:53,276 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2022-04-18 18:52:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -193350153, now seen corresponding path program 1 times
[2022-04-18 18:52:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764923567]
[2022-04-18 18:52:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:53,312 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 18:52:53,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:53,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764923567]
[2022-04-18 18:52:53,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764923567] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:52:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496065125]
[2022-04-18 18:52:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:53,314 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 18:52:53,329 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 18:52:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:53,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:52:53,373 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:52:53,412 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 18:52:53,412 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-18 18:52:53,441 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 18:52:53,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496065125] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-18 18:52:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [830388186]
[2022-04-18 18:52:53,448 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.<init>(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.<init>(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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(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.<init>(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 18:52:53,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-18 18:52:53,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2022-04-18 18:52:53,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322791558]
[2022-04-18 18:52:53,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-04-18 18:52:53,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-18 18:52:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-18 18:52:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2022-04-18 18:52:53,452 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:53,476 INFO L93 Difference]: Finished difference Result 31 states and 51 transitions.
[2022-04-18 18:52:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-18 18:52:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2022-04-18 18:52:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:53,478 INFO L225 Difference]: With dead ends: 31
[2022-04-18 18:52:53,478 INFO L226 Difference]: Without dead ends: 31
[2022-04-18 18:52:53,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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 18:52:53,479 INFO L913 BasicCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:53,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-04-18 18:52:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2022-04-18 18:52:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 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 18:52:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions.
[2022-04-18 18:52:53,483 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 8
[2022-04-18 18:52:53,483 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:53,483 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions.
[2022-04-18 18:52:53,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions.
[2022-04-18 18:52:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-18 18:52:53,484 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:53,484 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2022-04-18 18:52:53,511 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 18:52:53,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2022-04-18 18:52:53,704 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2022-04-18 18:52:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1377494, now seen corresponding path program 1 times
[2022-04-18 18:52:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:53,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527843962]
[2022-04-18 18:52:53,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:53,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:53,728 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-18 18:52:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:53,741 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2022-04-18 18:52:53,741 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-18 18:52:53,741 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2022-04-18 18:52:53,742 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2022-04-18 18:52:53,742 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2022-04-18 18:52:53,742 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2022-04-18 18:52:53,742 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2022-04-18 18:52:53,742 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2022-04-18 18:52:53,742 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2022-04-18 18:52:53,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-04-18 18:52:53,743 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-04-18 18:52:53,743 WARN L232 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-04-18 18:52:53,759 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2022-04-18 18:52:53,769 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2022-04-18 18:52:53,770 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-18 18:52:53,771 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 18:52:53,771 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2022-04-18 18:52:53,772 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-04-18 18:52:53,772 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 85 transitions, 200 flow
[2022-04-18 18:52:53,772 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 85 transitions, 200 flow
[2022-04-18 18:52:53,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 200 flow
[2022-04-18 18:52:53,808 INFO L129 PetriNetUnfolder]: 24/282 cut-off events.
[2022-04-18 18:52:53,808 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2022-04-18 18:52:53,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 282 events. 24/282 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 740 event pairs, 1 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 176. Up to 16 conditions per place.
[2022-04-18 18:52:53,812 INFO L116 LiptonReduction]: Number of co-enabled transitions 1764
[2022-04-18 18:52:55,352 INFO L131 LiptonReduction]: Checked pairs total: 2624
[2022-04-18 18:52:55,352 INFO L133 LiptonReduction]: Total number of compositions: 73
[2022-04-18 18:52:55,353 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 28 transitions, 86 flow
[2022-04-18 18:52:55,375 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 636 states, 551 states have (on average 3.0326678765880217) internal successors, (1671), 635 states have internal predecessors, (1671), 0 states have call successors, (0), 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 18:52:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 636 states, 551 states have (on average 3.0326678765880217) internal successors, (1671), 635 states have internal predecessors, (1671), 0 states have call successors, (0), 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 18:52:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-04-18 18:52:55,377 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:55,377 INFO L499 BasicCegarLoop]: trace histogram [1]
[2022-04-18 18:52:55,377 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2022-04-18 18:52:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times
[2022-04-18 18:52:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:55,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553870235]
[2022-04-18 18:52:55,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:55,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:55,384 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 18:52:55,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:55,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553870235]
[2022-04-18 18:52:55,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553870235] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:55,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:55,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-04-18 18:52:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761693542]
[2022-04-18 18:52:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:55,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-18 18:52:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-18 18:52:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:55,388 INFO L87 Difference]: Start difference. First operand has 636 states, 551 states have (on average 3.0326678765880217) internal successors, (1671), 635 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:55,407 INFO L93 Difference]: Finished difference Result 230 states and 479 transitions.
[2022-04-18 18:52:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-18 18:52:55,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1
[2022-04-18 18:52:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:55,409 INFO L225 Difference]: With dead ends: 230
[2022-04-18 18:52:55,409 INFO L226 Difference]: Without dead ends: 97
[2022-04-18 18:52:55,409 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:55,410 INFO L913 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:55,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2022-04-18 18:52:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2022-04-18 18:52:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 2.2065217391304346) internal successors, (203), 96 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 203 transitions.
[2022-04-18 18:52:55,423 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 203 transitions. Word has length 1
[2022-04-18 18:52:55,424 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:55,424 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 203 transitions.
[2022-04-18 18:52:55,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 203 transitions.
[2022-04-18 18:52:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2022-04-18 18:52:55,425 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:55,425 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1]
[2022-04-18 18:52:55,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-04-18 18:52:55,425 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2022-04-18 18:52:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 592526, now seen corresponding path program 1 times
[2022-04-18 18:52:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:55,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50416258]
[2022-04-18 18:52:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:55,452 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 18:52:55,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50416258]
[2022-04-18 18:52:55,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50416258] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:55,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:55,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-18 18:52:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183822102]
[2022-04-18 18:52:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:55,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-18 18:52:55,454 INFO L87 Difference]: Start difference. First operand 97 states and 203 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:55,471 INFO L93 Difference]: Finished difference Result 95 states and 201 transitions.
[2022-04-18 18:52:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2022-04-18 18:52:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:55,475 INFO L225 Difference]: With dead ends: 95
[2022-04-18 18:52:55,475 INFO L226 Difference]: Without dead ends: 95
[2022-04-18 18:52:55,475 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 18:52:55,476 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:55,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 6 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2022-04-18 18:52:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2022-04-18 18:52:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 2.208791208791209) internal successors, (201), 94 states have internal predecessors, (201), 0 states have call successors, (0), 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 18:52:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 201 transitions.
[2022-04-18 18:52:55,492 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 201 transitions. Word has length 3
[2022-04-18 18:52:55,492 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:55,493 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 201 transitions.
[2022-04-18 18:52:55,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 201 transitions.
[2022-04-18 18:52:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2022-04-18 18:52:55,493 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:55,494 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:55,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-04-18 18:52:55,494 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2022-04-18 18:52:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2013032702, now seen corresponding path program 1 times
[2022-04-18 18:52:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:55,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127399416]
[2022-04-18 18:52:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:55,526 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 18:52:55,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:55,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127399416]
[2022-04-18 18:52:55,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127399416] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:52:55,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099094264]
[2022-04-18 18:52:55,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:55,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:55,531 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 18:52:55,533 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 18:52:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:55,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:52:55,580 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:52:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-18 18:52:55,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-18 18:52:55,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099094264] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:55,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-18 18:52:55,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5
[2022-04-18 18:52:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261565043]
[2022-04-18 18:52:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:55,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:52:55,592 INFO L87 Difference]: Start difference. First operand 95 states and 201 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:55,609 INFO L93 Difference]: Finished difference Result 103 states and 203 transitions.
[2022-04-18 18:52:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:55,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2022-04-18 18:52:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:55,611 INFO L225 Difference]: With dead ends: 103
[2022-04-18 18:52:55,611 INFO L226 Difference]: Without dead ends: 100
[2022-04-18 18:52:55,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:52:55,612 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:55,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2022-04-18 18:52:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100.
[2022-04-18 18:52:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 2.0833333333333335) internal successors, (200), 99 states have internal predecessors, (200), 0 states have call successors, (0), 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 18:52:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 200 transitions.
[2022-04-18 18:52:55,616 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 200 transitions. Word has length 7
[2022-04-18 18:52:55,617 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:55,617 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 200 transitions.
[2022-04-18 18:52:55,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 200 transitions.
[2022-04-18 18:52:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2022-04-18 18:52:55,617 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:55,618 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:55,646 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 18:52:55,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2022-04-18 18:52:55,846 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2022-04-18 18:52:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2020500320, now seen corresponding path program 1 times
[2022-04-18 18:52:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:55,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4565432]
[2022-04-18 18:52:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:55,871 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 18:52:55,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4565432]
[2022-04-18 18:52:55,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4565432] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:52:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500786273]
[2022-04-18 18:52:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:55,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:55,873 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 18:52:55,879 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 18:52:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:55,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:52:55,961 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:52:55,979 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 18:52:55,979 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-18 18:52:56,009 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 18:52:56,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500786273] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-18 18:52:56,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1819759639]
[2022-04-18 18:52:56,010 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.<init>(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.<init>(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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(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.<init>(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 18:52:56,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-18 18:52:56,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2022-04-18 18:52:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562335857]
[2022-04-18 18:52:56,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-04-18 18:52:56,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-18 18:52:56,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-18 18:52:56,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2022-04-18 18:52:56,013 INFO L87 Difference]: Start difference. First operand 100 states and 200 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:56,048 INFO L93 Difference]: Finished difference Result 67 states and 139 transitions.
[2022-04-18 18:52:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-18 18:52:56,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2022-04-18 18:52:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:56,049 INFO L225 Difference]: With dead ends: 67
[2022-04-18 18:52:56,049 INFO L226 Difference]: Without dead ends: 67
[2022-04-18 18:52:56,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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 18:52:56,050 INFO L913 BasicCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:56,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2022-04-18 18:52:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2022-04-18 18:52:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.106060606060606) internal successors, (139), 66 states have internal predecessors, (139), 0 states have call successors, (0), 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 18:52:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 139 transitions.
[2022-04-18 18:52:56,053 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 139 transitions. Word has length 8
[2022-04-18 18:52:56,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:56,053 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 139 transitions.
[2022-04-18 18:52:56,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 139 transitions.
[2022-04-18 18:52:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-04-18 18:52:56,054 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:56,055 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2022-04-18 18:52:56,082 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 18:52:56,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:56,280 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2022-04-18 18:52:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash -937940451, now seen corresponding path program 1 times
[2022-04-18 18:52:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:56,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870813044]
[2022-04-18 18:52:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:56,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-18 18:52:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:56,305 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2022-04-18 18:52:56,306 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-18 18:52:56,306 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2022-04-18 18:52:56,306 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2022-04-18 18:52:56,306 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2022-04-18 18:52:56,306 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2022-04-18 18:52:56,306 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2022-04-18 18:52:56,307 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2022-04-18 18:52:56,307 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2022-04-18 18:52:56,307 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2022-04-18 18:52:56,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-04-18 18:52:56,307 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-04-18 18:52:56,308 WARN L232 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-04-18 18:52:56,308 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2022-04-18 18:52:56,319 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2022-04-18 18:52:56,320 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-18 18:52:56,320 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 18:52:56,320 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2022-04-18 18:52:56,321 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-04-18 18:52:56,321 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 93 transitions, 230 flow
[2022-04-18 18:52:56,322 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 93 transitions, 230 flow
[2022-04-18 18:52:56,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 230 flow
[2022-04-18 18:52:56,363 INFO L129 PetriNetUnfolder]: 47/488 cut-off events.
[2022-04-18 18:52:56,363 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2022-04-18 18:52:56,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 488 events. 47/488 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1733 event pairs, 6 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 302. Up to 32 conditions per place.
[2022-04-18 18:52:56,371 INFO L116 LiptonReduction]: Number of co-enabled transitions 2568
[2022-04-18 18:52:57,991 INFO L131 LiptonReduction]: Checked pairs total: 4197
[2022-04-18 18:52:57,991 INFO L133 LiptonReduction]: Total number of compositions: 79
[2022-04-18 18:52:57,992 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 108 flow
[2022-04-18 18:52:58,060 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2301 states, 2076 states have (on average 3.519267822736031) internal successors, (7306), 2300 states have internal predecessors, (7306), 0 states have call successors, (0), 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 18:52:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 2301 states, 2076 states have (on average 3.519267822736031) internal successors, (7306), 2300 states have internal predecessors, (7306), 0 states have call successors, (0), 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 18:52:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-04-18 18:52:58,065 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:58,065 INFO L499 BasicCegarLoop]: trace histogram [1]
[2022-04-18 18:52:58,066 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2022-04-18 18:52:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash 780, now seen corresponding path program 1 times
[2022-04-18 18:52:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257769038]
[2022-04-18 18:52:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:58,071 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 18:52:58,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:58,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257769038]
[2022-04-18 18:52:58,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257769038] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:58,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:58,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-04-18 18:52:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552064645]
[2022-04-18 18:52:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:58,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-18 18:52:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-18 18:52:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:58,079 INFO L87 Difference]: Start difference. First operand has 2301 states, 2076 states have (on average 3.519267822736031) internal successors, (7306), 2300 states have internal predecessors, (7306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:58,103 INFO L93 Difference]: Finished difference Result 604 states and 1497 transitions.
[2022-04-18 18:52:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-18 18:52:58,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1
[2022-04-18 18:52:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:58,105 INFO L225 Difference]: With dead ends: 604
[2022-04-18 18:52:58,105 INFO L226 Difference]: Without dead ends: 201
[2022-04-18 18:52:58,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:52:58,106 INFO L913 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:58,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2022-04-18 18:52:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201.
[2022-04-18 18:52:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 195 states have (on average 2.6205128205128205) internal successors, (511), 200 states have internal predecessors, (511), 0 states have call successors, (0), 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 18:52:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 511 transitions.
[2022-04-18 18:52:58,113 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 511 transitions. Word has length 1
[2022-04-18 18:52:58,114 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:58,114 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 511 transitions.
[2022-04-18 18:52:58,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 511 transitions.
[2022-04-18 18:52:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2022-04-18 18:52:58,114 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:58,114 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1]
[2022-04-18 18:52:58,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-04-18 18:52:58,115 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2022-04-18 18:52:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash 771128, now seen corresponding path program 1 times
[2022-04-18 18:52:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745351082]
[2022-04-18 18:52:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:58,128 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 18:52:58,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:58,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745351082]
[2022-04-18 18:52:58,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745351082] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:58,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:52:58,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-18 18:52:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453763522]
[2022-04-18 18:52:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:58,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:58,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-18 18:52:58,130 INFO L87 Difference]: Start difference. First operand 201 states and 511 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:58,146 INFO L93 Difference]: Finished difference Result 199 states and 509 transitions.
[2022-04-18 18:52:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:58,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2022-04-18 18:52:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:58,149 INFO L225 Difference]: With dead ends: 199
[2022-04-18 18:52:58,149 INFO L226 Difference]: Without dead ends: 199
[2022-04-18 18:52:58,149 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 18:52:58,150 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:58,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 6 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states.
[2022-04-18 18:52:58,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199.
[2022-04-18 18:52:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 2.6237113402061856) internal successors, (509), 198 states have internal predecessors, (509), 0 states have call successors, (0), 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 18:52:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 509 transitions.
[2022-04-18 18:52:58,156 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 509 transitions. Word has length 3
[2022-04-18 18:52:58,156 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:58,156 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 509 transitions.
[2022-04-18 18:52:58,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:52:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 509 transitions.
[2022-04-18 18:52:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2022-04-18 18:52:58,157 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:58,157 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:58,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-04-18 18:52:58,158 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2022-04-18 18:52:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash -354297429, now seen corresponding path program 1 times
[2022-04-18 18:52:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606746442]
[2022-04-18 18:52:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:58,177 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 18:52:58,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:58,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606746442]
[2022-04-18 18:52:58,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606746442] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:52:58,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80912518]
[2022-04-18 18:52:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:58,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:58,179 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 18:52:58,198 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 18:52:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:58,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:52:58,237 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:52:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-18 18:52:58,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-18 18:52:58,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80912518] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:52:58,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-18 18:52:58,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5
[2022-04-18 18:52:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019723368]
[2022-04-18 18:52:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:52:58,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:52:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:52:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:52:58,253 INFO L87 Difference]: Start difference. First operand 199 states and 509 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:58,284 INFO L93 Difference]: Finished difference Result 221 states and 534 transitions.
[2022-04-18 18:52:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:52:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2022-04-18 18:52:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:58,286 INFO L225 Difference]: With dead ends: 221
[2022-04-18 18:52:58,286 INFO L226 Difference]: Without dead ends: 217
[2022-04-18 18:52:58,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:52:58,287 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:58,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2022-04-18 18:52:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217.
[2022-04-18 18:52:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 2.5) internal successors, (530), 216 states have internal predecessors, (530), 0 states have call successors, (0), 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 18:52:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 530 transitions.
[2022-04-18 18:52:58,293 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 530 transitions. Word has length 7
[2022-04-18 18:52:58,293 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:58,293 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 530 transitions.
[2022-04-18 18:52:58,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 530 transitions.
[2022-04-18 18:52:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2022-04-18 18:52:58,294 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:58,294 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:58,319 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 18:52:58,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:58,509 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2022-04-18 18:52:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1901686676, now seen corresponding path program 1 times
[2022-04-18 18:52:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:58,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112788300]
[2022-04-18 18:52:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:58,531 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 18:52:58,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:52:58,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112788300]
[2022-04-18 18:52:58,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112788300] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:52:58,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787437361]
[2022-04-18 18:52:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:52:58,533 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 18:52:58,535 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 18:52:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:52:58,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:52:58,593 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:52:58,632 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 18:52:58,632 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-18 18:52:58,657 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 18:52:58,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787437361] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-18 18:52:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [616555297]
[2022-04-18 18:52:58,659 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.<init>(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.<init>(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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(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.<init>(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 18:52:58,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-18 18:52:58,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2022-04-18 18:52:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722236749]
[2022-04-18 18:52:58,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-04-18 18:52:58,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-18 18:52:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:52:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-18 18:52:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2022-04-18 18:52:58,661 INFO L87 Difference]: Start difference. First operand 217 states and 530 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:52:58,697 INFO L93 Difference]: Finished difference Result 184 states and 469 transitions.
[2022-04-18 18:52:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-18 18:52:58,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2022-04-18 18:52:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:52:58,699 INFO L225 Difference]: With dead ends: 184
[2022-04-18 18:52:58,699 INFO L226 Difference]: Without dead ends: 184
[2022-04-18 18:52:58,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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 18:52:58,701 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:52:58,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:52:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2022-04-18 18:52:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184.
[2022-04-18 18:52:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 2.576923076923077) internal successors, (469), 183 states have internal predecessors, (469), 0 states have call successors, (0), 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 18:52:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 469 transitions.
[2022-04-18 18:52:58,707 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 469 transitions. Word has length 8
[2022-04-18 18:52:58,707 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:52:58,707 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 469 transitions.
[2022-04-18 18:52:58,707 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:52:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 469 transitions.
[2022-04-18 18:52:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2022-04-18 18:52:58,713 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:52:58,714 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:52:58,741 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 18:52:58,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:52:58,937 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2022-04-18 18:52:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:52:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash -350642717, now seen corresponding path program 1 times
[2022-04-18 18:52:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:52:58,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231639058]
[2022-04-18 18:52:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:52:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:52:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:58,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-18 18:52:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:52:58,991 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2022-04-18 18:52:58,992 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-18 18:52:58,992 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2022-04-18 18:52:58,992 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2022-04-18 18:52:58,992 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2022-04-18 18:52:58,993 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2022-04-18 18:52:58,993 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2022-04-18 18:52:58,993 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2022-04-18 18:52:58,993 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2022-04-18 18:52:58,993 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2022-04-18 18:52:58,994 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2022-04-18 18:52:58,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-04-18 18:52:58,995 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-04-18 18:52:58,995 WARN L232 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-04-18 18:52:58,995 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2022-04-18 18:52:59,014 INFO L135 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2022-04-18 18:52:59,016 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-18 18:52:59,016 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 18:52:59,016 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2022-04-18 18:52:59,019 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-04-18 18:52:59,019 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 101 transitions, 262 flow
[2022-04-18 18:52:59,019 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 101 transitions, 262 flow
[2022-04-18 18:52:59,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 262 flow
[2022-04-18 18:52:59,106 INFO L129 PetriNetUnfolder]: 98/882 cut-off events.
[2022-04-18 18:52:59,107 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES.
[2022-04-18 18:52:59,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 882 events. 98/882 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4067 event pairs, 23 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 533. Up to 80 conditions per place.
[2022-04-18 18:52:59,124 INFO L116 LiptonReduction]: Number of co-enabled transitions 3480
[2022-04-18 18:53:00,709 INFO L131 LiptonReduction]: Checked pairs total: 5958
[2022-04-18 18:53:00,709 INFO L133 LiptonReduction]: Total number of compositions: 81
[2022-04-18 18:53:00,710 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 130 flow
[2022-04-18 18:53:01,005 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8448 states, 7835 states have (on average 3.9608168474792596) internal successors, (31033), 8447 states have internal predecessors, (31033), 0 states have call successors, (0), 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 18:53:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 8448 states, 7835 states have (on average 3.9608168474792596) internal successors, (31033), 8447 states have internal predecessors, (31033), 0 states have call successors, (0), 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 18:53:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2022-04-18 18:53:01,029 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:01,029 INFO L499 BasicCegarLoop]: trace histogram [1]
[2022-04-18 18:53:01,030 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash 969, now seen corresponding path program 1 times
[2022-04-18 18:53:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:01,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426190972]
[2022-04-18 18:53:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:01,035 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 18:53:01,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:53:01,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426190972]
[2022-04-18 18:53:01,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426190972] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:53:01,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:53:01,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2022-04-18 18:53:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600062349]
[2022-04-18 18:53:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:53:01,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-18 18:53:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:53:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-18 18:53:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:53:01,058 INFO L87 Difference]: Start difference. First operand has 8448 states, 7835 states have (on average 3.9608168474792596) internal successors, (31033), 8447 states have internal predecessors, (31033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:53:01,096 INFO L93 Difference]: Finished difference Result 1622 states and 4663 transitions.
[2022-04-18 18:53:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-18 18:53:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1
[2022-04-18 18:53:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:53:01,100 INFO L225 Difference]: With dead ends: 1622
[2022-04-18 18:53:01,100 INFO L226 Difference]: Without dead ends: 409
[2022-04-18 18:53:01,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-18 18:53:01,102 INFO L913 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:53:01,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:53:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states.
[2022-04-18 18:53:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409.
[2022-04-18 18:53:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 402 states have (on average 3.0621890547263684) internal successors, (1231), 408 states have internal predecessors, (1231), 0 states have call successors, (0), 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 18:53:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1231 transitions.
[2022-04-18 18:53:01,113 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1231 transitions. Word has length 1
[2022-04-18 18:53:01,113 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:53:01,113 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 1231 transitions.
[2022-04-18 18:53:01,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1231 transitions.
[2022-04-18 18:53:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2022-04-18 18:53:01,113 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:01,114 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1]
[2022-04-18 18:53:01,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-04-18 18:53:01,114 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 960687, now seen corresponding path program 1 times
[2022-04-18 18:53:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:01,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645625243]
[2022-04-18 18:53:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:01,128 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 18:53:01,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:53:01,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645625243]
[2022-04-18 18:53:01,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645625243] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:53:01,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-18 18:53:01,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-18 18:53:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850008232]
[2022-04-18 18:53:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:53:01,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:53:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:53:01,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:53:01,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-18 18:53:01,130 INFO L87 Difference]: Start difference. First operand 409 states and 1231 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:53:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:53:01,149 INFO L93 Difference]: Finished difference Result 407 states and 1229 transitions.
[2022-04-18 18:53:01,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:53:01,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2022-04-18 18:53:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:53:01,152 INFO L225 Difference]: With dead ends: 407
[2022-04-18 18:53:01,152 INFO L226 Difference]: Without dead ends: 407
[2022-04-18 18:53:01,153 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 18:53:01,154 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:53:01,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 6 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:53:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states.
[2022-04-18 18:53:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407.
[2022-04-18 18:53:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 401 states have (on average 3.064837905236908) internal successors, (1229), 406 states have internal predecessors, (1229), 0 states have call successors, (0), 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 18:53:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1229 transitions.
[2022-04-18 18:53:01,165 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1229 transitions. Word has length 3
[2022-04-18 18:53:01,165 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:53:01,165 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1229 transitions.
[2022-04-18 18:53:01,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:53:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1229 transitions.
[2022-04-18 18:53:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2022-04-18 18:53:01,166 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:01,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:53:01,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-04-18 18:53:01,166 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1031599332, now seen corresponding path program 1 times
[2022-04-18 18:53:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:01,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142401111]
[2022-04-18 18:53:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:01,195 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 18:53:01,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:53:01,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142401111]
[2022-04-18 18:53:01,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142401111] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:53:01,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124272144]
[2022-04-18 18:53:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:53:01,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:53:01,199 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 18:53:01,219 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 18:53:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:01,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:53:01,267 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:53:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-18 18:53:01,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-18 18:53:01,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124272144] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:53:01,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-18 18:53:01,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5
[2022-04-18 18:53:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005263660]
[2022-04-18 18:53:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:53:01,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-18 18:53:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:53:01,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-18 18:53:01,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:53:01,281 INFO L87 Difference]: Start difference. First operand 407 states and 1229 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:53:01,315 INFO L93 Difference]: Finished difference Result 459 states and 1323 transitions.
[2022-04-18 18:53:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-18 18:53:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2022-04-18 18:53:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:53:01,319 INFO L225 Difference]: With dead ends: 459
[2022-04-18 18:53:01,319 INFO L226 Difference]: Without dead ends: 454
[2022-04-18 18:53:01,319 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-18 18:53:01,319 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:53:01,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:53:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states.
[2022-04-18 18:53:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454.
[2022-04-18 18:53:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 448 states have (on average 2.9419642857142856) internal successors, (1318), 453 states have internal predecessors, (1318), 0 states have call successors, (0), 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 18:53:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1318 transitions.
[2022-04-18 18:53:01,331 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1318 transitions. Word has length 7
[2022-04-18 18:53:01,331 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:53:01,331 INFO L478 AbstractCegarLoop]: Abstraction has 454 states and 1318 transitions.
[2022-04-18 18:53:01,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1318 transitions.
[2022-04-18 18:53:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2022-04-18 18:53:01,332 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:01,332 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:53:01,357 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 18:53:01,555 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,SelfDestructingSolverStorable20
[2022-04-18 18:53:01,555 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1914802488, now seen corresponding path program 1 times
[2022-04-18 18:53:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:01,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554159644]
[2022-04-18 18:53:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:01,587 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 18:53:01,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:53:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554159644]
[2022-04-18 18:53:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554159644] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:53:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487750621]
[2022-04-18 18:53:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:53:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:53:01,589 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 18:53:01,616 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 18:53:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:01,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-04-18 18:53:01,659 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:53:01,677 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 18:53:01,677 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-18 18:53:01,697 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 18:53:01,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487750621] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-18 18:53:01,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1711855271]
[2022-04-18 18:53:01,697 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.<init>(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.<init>(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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(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.<init>(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 18:53:01,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-18 18:53:01,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2022-04-18 18:53:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014362816]
[2022-04-18 18:53:01,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-04-18 18:53:01,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-18 18:53:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:53:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-18 18:53:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2022-04-18 18:53:01,699 INFO L87 Difference]: Start difference. First operand 454 states and 1318 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:53:01,742 INFO L93 Difference]: Finished difference Result 421 states and 1257 transitions.
[2022-04-18 18:53:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-18 18:53:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2022-04-18 18:53:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:53:01,746 INFO L225 Difference]: With dead ends: 421
[2022-04-18 18:53:01,746 INFO L226 Difference]: Without dead ends: 421
[2022-04-18 18:53:01,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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 18:53:01,747 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:53:01,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:53:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2022-04-18 18:53:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421.
[2022-04-18 18:53:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 418 states have (on average 3.007177033492823) internal successors, (1257), 420 states have internal predecessors, (1257), 0 states have call successors, (0), 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 18:53:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1257 transitions.
[2022-04-18 18:53:01,757 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1257 transitions. Word has length 8
[2022-04-18 18:53:01,758 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:53:01,758 INFO L478 AbstractCegarLoop]: Abstraction has 421 states and 1257 transitions.
[2022-04-18 18:53:01,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1257 transitions.
[2022-04-18 18:53:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-18 18:53:01,759 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:01,759 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:53:01,789 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 18:53:01,980 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,SelfDestructingSolverStorable21
[2022-04-18 18:53:01,980 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -978355041, now seen corresponding path program 1 times
[2022-04-18 18:53:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057624637]
[2022-04-18 18:53:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-18 18:53:02,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:53:02,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057624637]
[2022-04-18 18:53:02,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057624637] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:53:02,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746030069]
[2022-04-18 18:53:02,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:02,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:53:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:53:02,043 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-18 18:53:02,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-04-18 18:53:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:02,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core
[2022-04-18 18:53:02,111 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:53:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-18 18:53:02,152 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-18 18:53:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-18 18:53:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746030069] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-18 18:53:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523375017]
[2022-04-18 18:53:02,214 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.<init>(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.<init>(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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(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.<init>(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 18:53:02,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-18 18:53:02,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7
[2022-04-18 18:53:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711650181]
[2022-04-18 18:53:02,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-04-18 18:53:02,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-18 18:53:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:53:02,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-18 18:53:02,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2022-04-18 18:53:02,216 INFO L87 Difference]: Start difference. First operand 421 states and 1257 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:53:02,264 INFO L93 Difference]: Finished difference Result 376 states and 1139 transitions.
[2022-04-18 18:53:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-18 18:53:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20
[2022-04-18 18:53:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:53:02,267 INFO L225 Difference]: With dead ends: 376
[2022-04-18 18:53:02,267 INFO L226 Difference]: Without dead ends: 376
[2022-04-18 18:53:02,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2022-04-18 18:53:02,267 INFO L913 BasicCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:53:02,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 13 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:53:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states.
[2022-04-18 18:53:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376.
[2022-04-18 18:53:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 3.0454545454545454) internal successors, (1139), 375 states have internal predecessors, (1139), 0 states have call successors, (0), 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 18:53:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1139 transitions.
[2022-04-18 18:53:02,277 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1139 transitions. Word has length 20
[2022-04-18 18:53:02,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:53:02,278 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1139 transitions.
[2022-04-18 18:53:02,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1139 transitions.
[2022-04-18 18:53:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-18 18:53:02,279 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:02,279 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:53:02,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2022-04-18 18:53:02,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:53:02,499 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 121683245, now seen corresponding path program 1 times
[2022-04-18 18:53:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:02,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124608182]
[2022-04-18 18:53:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-18 18:53:02,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-04-18 18:53:02,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124608182]
[2022-04-18 18:53:02,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124608182] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-18 18:53:02,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76131126]
[2022-04-18 18:53:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:02,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-18 18:53:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
[2022-04-18 18:53:02,565 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-18 18:53:02,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-04-18 18:53:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-18 18:53:02,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-18 18:53:02,648 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-18 18:53:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-18 18:53:02,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-18 18:53:02,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76131126] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-18 18:53:02,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-18 18:53:02,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8
[2022-04-18 18:53:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750142111]
[2022-04-18 18:53:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-18 18:53:02,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-18 18:53:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-04-18 18:53:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-18 18:53:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2022-04-18 18:53:02,694 INFO L87 Difference]: Start difference. First operand 376 states and 1139 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-18 18:53:02,742 INFO L93 Difference]: Finished difference Result 312 states and 915 transitions.
[2022-04-18 18:53:02,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-18 18:53:02,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23
[2022-04-18 18:53:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-18 18:53:02,745 INFO L225 Difference]: With dead ends: 312
[2022-04-18 18:53:02,745 INFO L226 Difference]: Without dead ends: 309
[2022-04-18 18:53:02,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2022-04-18 18:53:02,745 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-18 18:53:02,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-18 18:53:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2022-04-18 18:53:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309.
[2022-04-18 18:53:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.9155844155844157) internal successors, (898), 308 states have internal predecessors, (898), 0 states have call successors, (0), 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 18:53:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 898 transitions.
[2022-04-18 18:53:02,754 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 898 transitions. Word has length 23
[2022-04-18 18:53:02,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-18 18:53:02,754 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 898 transitions.
[2022-04-18 18:53:02,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-18 18:53:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 898 transitions.
[2022-04-18 18:53:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-18 18:53:02,755 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-18 18:53:02,755 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:53:02,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2022-04-18 18:53:02,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2022-04-18 18:53:02,975 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2022-04-18 18:53:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-18 18:53:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -522807474, now seen corresponding path program 1 times
[2022-04-18 18:53:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-04-18 18:53:02,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564456360]
[2022-04-18 18:53:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-18 18:53:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-18 18:53:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:53:02,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-18 18:53:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-18 18:53:03,003 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2022-04-18 18:53:03,003 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-18 18:53:03,003 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining)
[2022-04-18 18:53:03,003 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2022-04-18 18:53:03,003 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2022-04-18 18:53:03,003 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 10 remaining)
[2022-04-18 18:53:03,004 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2022-04-18 18:53:03,004 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2022-04-18 18:53:03,004 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2022-04-18 18:53:03,004 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2022-04-18 18:53:03,004 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2022-04-18 18:53:03,004 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2022-04-18 18:53:03,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-04-18 18:53:03,004 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2022-04-18 18:53:03,008 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 5 thread instances
[2022-04-18 18:53:03,008 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-18 18:53:03,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 06:53:03 BasicIcfg
[2022-04-18 18:53:03,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-18 18:53:03,062 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-04-18 18:53:03,062 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-04-18 18:53:03,062 INFO L275 PluginConnector]: Witness Printer initialized
[2022-04-18 18:53:03,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:52:48" (3/4) ...
[2022-04-18 18:53:03,064 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2022-04-18 18:53:03,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-04-18 18:53:03,065 INFO L158 Benchmark]: Toolchain (without parser) took 15397.54ms. Allocated memory was 123.7MB in the beginning and 237.0MB in the end (delta: 113.2MB). Free memory was 99.3MB in the beginning and 121.4MB in the end (delta: -22.1MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB.
[2022-04-18 18:53:03,065 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-04-18 18:53:03,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.12ms. Allocated memory is still 123.7MB. Free memory was 98.8MB in the beginning and 88.9MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-04-18 18:53:03,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 123.7MB. Free memory was 88.9MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-04-18 18:53:03,066 INFO L158 Benchmark]: Boogie Preprocessor took 39.32ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 85.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2022-04-18 18:53:03,066 INFO L158 Benchmark]: RCFGBuilder took 406.52ms. Allocated memory is still 123.7MB. Free memory was 85.3MB in the beginning and 72.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2022-04-18 18:53:03,069 INFO L158 Benchmark]: TraceAbstraction took 14467.97ms. Allocated memory was 123.7MB in the beginning and 237.0MB in the end (delta: 113.2MB). Free memory was 71.6MB in the beginning and 122.4MB in the end (delta: -50.8MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB.
[2022-04-18 18:53:03,069 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 237.0MB. Free memory was 122.4MB in the beginning and 121.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2022-04-18 18:53:03,070 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.19ms. Allocated memory is still 123.7MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 417.12ms. Allocated memory is still 123.7MB. Free memory was 98.8MB in the beginning and 88.9MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 57.93ms. Allocated memory is still 123.7MB. Free memory was 88.9MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 39.32ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 85.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 406.52ms. Allocated memory is still 123.7MB. Free memory was 85.3MB in the beginning and 72.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 14467.97ms. Allocated memory was 123.7MB in the beginning and 237.0MB in the end (delta: 113.2MB). Free memory was 71.6MB in the beginning and 122.4MB in the end (delta: -50.8MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB.
* Witness Printer took 2.75ms. Allocated memory is still 237.0MB. Free memory was 122.4MB in the beginning and 121.4MB in the end (delta: 1.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: 1.9s, 68 PlacesBefore, 19 PlacesAfterwards, 69 TransitionsBefore, 17 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 63 TotalNumberOfCompositions, 465 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 407, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 277, positive: 259, positive conditional: 0, positive unconditional: 259, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 277, positive: 251, positive conditional: 0, positive unconditional: 251, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 407, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 277, unknown conditional: 0, unknown unconditional: 277] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5
- 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
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.6s, 77 PlacesBefore, 26 PlacesAfterwards, 77 TransitionsBefore, 23 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 5 FixpointIterations, 23 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 68 TotalNumberOfCompositions, 1560 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1301, positive: 1255, positive conditional: 0, positive unconditional: 1255, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 738, positive: 707, positive conditional: 0, positive unconditional: 707, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 738, positive: 694, positive conditional: 0, positive unconditional: 694, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1301, positive: 548, positive conditional: 0, positive unconditional: 548, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 738, unknown conditional: 0, unknown unconditional: 738] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6
- 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
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.6s, 86 PlacesBefore, 31 PlacesAfterwards, 85 TransitionsBefore, 28 TransitionsAfterwards, 1764 CoEnabledTransitionPairs, 5 FixpointIterations, 23 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 73 TotalNumberOfCompositions, 2624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2072, positive: 2024, positive conditional: 0, positive unconditional: 2024, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1190, positive: 1167, positive conditional: 0, positive unconditional: 1167, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1190, positive: 1142, positive conditional: 0, positive unconditional: 1142, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2072, positive: 857, positive conditional: 0, positive unconditional: 857, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1190, unknown conditional: 0, unknown unconditional: 1190] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7
- 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
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.7s, 95 PlacesBefore, 36 PlacesAfterwards, 93 TransitionsBefore, 32 TransitionsAfterwards, 2568 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3241, positive: 3175, positive conditional: 0, positive unconditional: 3175, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1712, positive: 1683, positive conditional: 0, positive unconditional: 1683, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1712, positive: 1650, positive conditional: 0, positive unconditional: 1650, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3241, positive: 1492, positive conditional: 0, positive unconditional: 1492, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 1712, unknown conditional: 0, unknown unconditional: 1712] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8
- 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
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.7s, 104 PlacesBefore, 41 PlacesAfterwards, 101 TransitionsBefore, 35 TransitionsAfterwards, 3480 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 81 TotalNumberOfCompositions, 5958 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4768, positive: 4701, positive conditional: 0, positive unconditional: 4701, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2319, positive: 2292, positive conditional: 0, positive unconditional: 2292, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2319, positive: 2261, positive conditional: 0, positive unconditional: 2261, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4768, positive: 2409, positive conditional: 0, positive unconditional: 2409, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 2319, unknown conditional: 0, unknown unconditional: 2319] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9
- 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: 726]: Data race detected
Data race detected
The following path leads to a data race:
[L710] 0 intptr_t x;
[L719] 0 pthread_t t[5 + 1];
[L721] 0 x = 0
[L723] 0 intptr_t i = 1;
VAL [\old(argc)=50, argc=50, argv={51:52}, argv={51:52}, i=1, t={3:0}, x=0]
[L723] COND TRUE 0 i <= 5
[L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i)
VAL [\old(argc)=50, arg={0:1}, argc=50, argv={51:52}, argv={51:52}, i=1, pthread_create(t + i, 0, thread, (void *)i)=-5, t={3:0}, x=0]
[L723] 0 i++
VAL [\old(argc)=50, arg={0:1}, argc=50, argv={51:52}, argv={51:52}, i=2, t={3:0}, x=0]
[L723] COND TRUE 0 i <= 5
[L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i)
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=2, pthread_create(t + i, 0, thread, (void *)i)=-4, t={3:0}, x=0]
[L723] 0 i++
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=3, t={3:0}, x=0]
[L723] COND TRUE 0 i <= 5
[L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i)
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=3, pthread_create(t + i, 0, thread, (void *)i)=-3, t={3:0}, x=0]
[L723] 0 i++
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=4, t={3:0}, x=0]
[L723] COND TRUE 0 i <= 5
[L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i)
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=4, pthread_create(t + i, 0, thread, (void *)i)=-2, t={3:0}, x=0]
[L723] 0 i++
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=5, t={3:0}, x=0]
[L723] COND TRUE 0 i <= 5
[L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i)
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=5, pthread_create(t + i, 0, thread, (void *)i)=-1, t={3:0}, x=0]
[L723] 0 i++
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=6, t={3:0}, x=0]
[L723] COND FALSE 0 !(i <= 5)
[L726] 0 x < 5 + 1
VAL [\old(argc)=50, arg={0:2}, argc=50, argv={51:52}, argv={51:52}, i=6, t={3:0}, x=0]
[L712] 4 intptr_t thread = (intptr_t)arg;
[L714] 4 x = thread
[L716] 4 return ((void *)0);
[L726] 0 x < 5 + 1
VAL [\old(argc)=50, \result={0:0}, arg={0:2}, arg={0:4}, argc=50, argv={51:52}, argv={51:52}, i=6, t={3:0}, thread=4, x=4]
Now there is a data race on ~x~0 between
C: x = thread [714]
and
C: x < 5 + 1 [726]
- UnprovableResult [Line: 721]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 730]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 724]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 714]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 3 procedures, 73 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
CFG has 4 procedures, 80 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1/5 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
- StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
CFG has 5 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=636occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1/5 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
- StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
CFG has 6 procedures, 94 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 14 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2301occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1/5 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
- StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances
CFG has 7 procedures, 101 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 23 mSDtfsCounter, 298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8448occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 84/189 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 18:53:03,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE