/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:13:18,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:13:18,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:13:18,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:13:18,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:13:18,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:13:18,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:13:18,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:13:18,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:13:18,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:13:18,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:13:18,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:13:18,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:13:18,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:13:18,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:13:18,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:13:18,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:13:18,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:13:18,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:13:18,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:13:18,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:13:18,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:13:18,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:13:18,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:13:18,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:13:18,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:13:18,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:13:18,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:13:18,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:13:18,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:13:18,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:13:18,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:13:18,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:13:18,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:13:18,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:13:18,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:13:18,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:13:18,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:13:18,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:13:18,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:13:18,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:13:18,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:13:18,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:13:18,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:13:18,427 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:13:18,427 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:13:18,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:13:18,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:13:18,428 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:13:18,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:13:18,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:13:18,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:13:18,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:13:18,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:18,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:13:18,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:13:18,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:13:18,431 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:13:18,431 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:13:18,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:13:18,431 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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/UAutomizer-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: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:13:18,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:13:18,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:13:18,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:13:18,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:13:18,639 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:13:18,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-15 20:13:18,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db6cd081/c6e702be7e2a476688e67e15a9cacd83/FLAGebcbf961e [2022-03-15 20:13:19,281 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:13:19,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-15 20:13:19,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db6cd081/c6e702be7e2a476688e67e15a9cacd83/FLAGebcbf961e [2022-03-15 20:13:19,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db6cd081/c6e702be7e2a476688e67e15a9cacd83 [2022-03-15 20:13:19,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:13:19,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:13:19,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:19,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:13:19,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:13:19,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf7de94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19, skipping insertion in model container [2022-03-15 20:13:19,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:13:19,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:13:20,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:20,079 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:13:20,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:20,168 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:13:20,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20 WrapperNode [2022-03-15 20:13:20,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:20,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:20,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:13:20,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:13:20,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,231 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-03-15 20:13:20,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:20,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:13:20,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:13:20,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:13:20,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:13:20,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:13:20,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:13:20,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:13:20,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (1/1) ... [2022-03-15 20:13:20,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:20,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:20,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:13:20,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:13:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:13:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:13:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:13:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:13:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:13:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:13:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:13:20,410 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:13:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:13:20,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:13:20,411 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:13:20,597 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:13:20,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:13:20,777 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:13:20,782 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:13:20,782 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 20:13:20,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:20 BoogieIcfgContainer [2022-03-15 20:13:20,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:13:20,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:13:20,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:13:20,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:13:20,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:13:19" (1/3) ... [2022-03-15 20:13:20,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3c0204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:20, skipping insertion in model container [2022-03-15 20:13:20,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:20" (2/3) ... [2022-03-15 20:13:20,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3c0204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:20, skipping insertion in model container [2022-03-15 20:13:20,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:20" (3/3) ... [2022-03-15 20:13:20,800 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-03-15 20:13:20,804 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:13:20,805 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:13:20,805 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-15 20:13:20,805 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:13:20,835 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,835 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,837 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,837 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,837 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,837 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,839 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,839 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,863 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:13:20,892 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:13:20,897 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:13:20,897 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-15 20:13:20,905 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:13:20,910 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 125 transitions, 255 flow [2022-03-15 20:13:20,912 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 125 transitions, 255 flow [2022-03-15 20:13:20,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 255 flow [2022-03-15 20:13:20,965 INFO L129 PetriNetUnfolder]: 6/124 cut-off events. [2022-03-15 20:13:20,965 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:13:20,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 218 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-03-15 20:13:20,973 INFO L116 LiptonReduction]: Number of co-enabled transitions 4636 [2022-03-15 20:13:22,067 INFO L131 LiptonReduction]: Checked pairs total: 13464 [2022-03-15 20:13:22,067 INFO L133 LiptonReduction]: Total number of compositions: 74 [2022-03-15 20:13:22,072 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 113 flow [2022-03-15 20:13:22,108 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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-03-15 20:13:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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-03-15 20:13:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:13:22,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:22,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:22,116 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash 708503634, now seen corresponding path program 1 times [2022-03-15 20:13:22,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:22,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325873993] [2022-03-15 20:13:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:22,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:22,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325873993] [2022-03-15 20:13:22,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325873993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:22,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:13:22,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:13:22,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915511546] [2022-03-15 20:13:22,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:22,243 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:22,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:13:22,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:22,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:22,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:13:22,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:13:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:13:22,270 INFO L87 Difference]: Start difference. First operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-03-15 20:13:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:22,321 INFO L93 Difference]: Finished difference Result 561 states and 1119 transitions. [2022-03-15 20:13:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:13:22,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:13:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:22,339 INFO L225 Difference]: With dead ends: 561 [2022-03-15 20:13:22,339 INFO L226 Difference]: Without dead ends: 561 [2022-03-15 20:13:22,340 INFO L932 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-03-15 20:13:22,343 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:22,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-03-15 20:13:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2022-03-15 20:13:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 547 states have (on average 2.045703839122486) internal successors, (1119), 560 states have internal predecessors, (1119), 0 states have call successors, (0), 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-03-15 20:13:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1119 transitions. [2022-03-15 20:13:22,406 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1119 transitions. Word has length 10 [2022-03-15 20:13:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:22,411 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 1119 transitions. [2022-03-15 20:13:22,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-03-15 20:13:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1119 transitions. [2022-03-15 20:13:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:13:22,413 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:22,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:22,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:13:22,413 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1212709316, now seen corresponding path program 1 times [2022-03-15 20:13:22,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:22,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472238569] [2022-03-15 20:13:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:22,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:22,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472238569] [2022-03-15 20:13:22,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472238569] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:22,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194429959] [2022-03-15 20:13:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:22,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:22,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:13:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-15 20:13:22,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:13:22,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:22,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194429959] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:22,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:22,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-03-15 20:13:22,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35023487] [2022-03-15 20:13:22,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:22,573 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:22,574 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:13:22,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:22,575 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:22,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:13:22,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:13:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:13:22,575 INFO L87 Difference]: Start difference. First operand 561 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:13:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:22,610 INFO L93 Difference]: Finished difference Result 849 states and 1695 transitions. [2022-03-15 20:13:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:13:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:13:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:22,613 INFO L225 Difference]: With dead ends: 849 [2022-03-15 20:13:22,613 INFO L226 Difference]: Without dead ends: 849 [2022-03-15 20:13:22,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-03-15 20:13:22,614 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:22,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-03-15 20:13:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 579. [2022-03-15 20:13:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 565 states have (on average 2.0442477876106193) internal successors, (1155), 578 states have internal predecessors, (1155), 0 states have call successors, (0), 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-03-15 20:13:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1155 transitions. [2022-03-15 20:13:22,629 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1155 transitions. Word has length 11 [2022-03-15 20:13:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:22,629 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 1155 transitions. [2022-03-15 20:13:22,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:13:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1155 transitions. [2022-03-15 20:13:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:13:22,655 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:22,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:22,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:22,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:22,856 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1012489544, now seen corresponding path program 1 times [2022-03-15 20:13:22,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:22,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037158968] [2022-03-15 20:13:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:22,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:22,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037158968] [2022-03-15 20:13:22,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037158968] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:22,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189499867] [2022-03-15 20:13:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:22,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:22,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:22,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:13:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:23,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:13:23,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:23,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:23,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189499867] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:23,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:23,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 20:13:23,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930443324] [2022-03-15 20:13:23,090 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:23,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:23,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 20:13:23,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:23,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:23,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:13:23,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:13:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:13:23,093 INFO L87 Difference]: Start difference. First operand 579 states and 1155 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-15 20:13:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:23,132 INFO L93 Difference]: Finished difference Result 580 states and 1156 transitions. [2022-03-15 20:13:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:13:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:13:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:23,135 INFO L225 Difference]: With dead ends: 580 [2022-03-15 20:13:23,135 INFO L226 Difference]: Without dead ends: 580 [2022-03-15 20:13:23,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-03-15 20:13:23,136 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:23,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-03-15 20:13:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2022-03-15 20:13:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 566 states have (on average 2.0424028268551235) internal successors, (1156), 579 states have internal predecessors, (1156), 0 states have call successors, (0), 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-03-15 20:13:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1156 transitions. [2022-03-15 20:13:23,165 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1156 transitions. Word has length 12 [2022-03-15 20:13:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:23,165 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 1156 transitions. [2022-03-15 20:13:23,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-15 20:13:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1156 transitions. [2022-03-15 20:13:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:13:23,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:23,166 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:23,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:23,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 20:13:23,367 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1562781874, now seen corresponding path program 2 times [2022-03-15 20:13:23,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:23,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370744838] [2022-03-15 20:13:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:23,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:23,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370744838] [2022-03-15 20:13:23,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370744838] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:23,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984946839] [2022-03-15 20:13:23,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:23,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:23,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:23,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:23,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:13:23,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:23,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:23,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:13:23,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:23,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:23,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:23,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,617 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:23,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:23,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,657 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:23,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:13:23,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:23,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984946839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:23,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:23,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 11 [2022-03-15 20:13:23,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874001426] [2022-03-15 20:13:23,676 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:23,677 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:23,678 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:13:23,678 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:23,678 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:23,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:23,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:23,680 INFO L87 Difference]: Start difference. First operand 580 states and 1156 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-15 20:13:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:23,970 INFO L93 Difference]: Finished difference Result 1220 states and 2436 transitions. [2022-03-15 20:13:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:23,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:13:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:23,974 INFO L225 Difference]: With dead ends: 1220 [2022-03-15 20:13:23,975 INFO L226 Difference]: Without dead ends: 1220 [2022-03-15 20:13:23,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:13:23,978 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:23,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 80 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-03-15 20:13:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 688. [2022-03-15 20:13:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 674 states have (on average 2.035608308605341) internal successors, (1372), 687 states have internal predecessors, (1372), 0 states have call successors, (0), 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-03-15 20:13:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1372 transitions. [2022-03-15 20:13:23,995 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1372 transitions. Word has length 13 [2022-03-15 20:13:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:23,995 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1372 transitions. [2022-03-15 20:13:23,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-15 20:13:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1372 transitions. [2022-03-15 20:13:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:13:23,998 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:23,998 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:24,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 20:13:24,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:24,216 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -727646897, now seen corresponding path program 1 times [2022-03-15 20:13:24,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:24,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344730425] [2022-03-15 20:13:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:24,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:24,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344730425] [2022-03-15 20:13:24,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344730425] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:24,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174718860] [2022-03-15 20:13:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:24,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:24,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:24,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:13:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:24,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:13:24,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:24,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:24,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174718860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:24,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:24,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 20:13:24,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [851978658] [2022-03-15 20:13:24,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:24,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:24,476 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:13:24,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:24,477 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:24,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:13:24,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:13:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:13:24,477 INFO L87 Difference]: Start difference. First operand 688 states and 1372 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-15 20:13:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:24,498 INFO L93 Difference]: Finished difference Result 689 states and 1373 transitions. [2022-03-15 20:13:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:13:24,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:13:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:24,514 INFO L225 Difference]: With dead ends: 689 [2022-03-15 20:13:24,514 INFO L226 Difference]: Without dead ends: 689 [2022-03-15 20:13:24,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:13:24,514 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:24,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-03-15 20:13:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2022-03-15 20:13:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 675 states have (on average 2.034074074074074) internal successors, (1373), 688 states have internal predecessors, (1373), 0 states have call successors, (0), 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-03-15 20:13:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1373 transitions. [2022-03-15 20:13:24,529 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1373 transitions. Word has length 13 [2022-03-15 20:13:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:24,529 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 1373 transitions. [2022-03-15 20:13:24,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-15 20:13:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1373 transitions. [2022-03-15 20:13:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:13:24,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:24,531 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:24,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:24,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:24,747 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -848453851, now seen corresponding path program 2 times [2022-03-15 20:13:24,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:24,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693199292] [2022-03-15 20:13:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:13:24,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:24,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693199292] [2022-03-15 20:13:24,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693199292] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:24,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:13:24,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:13:24,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069630882] [2022-03-15 20:13:24,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:24,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:24,883 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2022-03-15 20:13:24,883 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:24,883 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:24,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:24,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:13:24,884 INFO L87 Difference]: Start difference. First operand 689 states and 1373 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-15 20:13:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:25,158 INFO L93 Difference]: Finished difference Result 861 states and 1717 transitions. [2022-03-15 20:13:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:25,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:13:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:25,162 INFO L225 Difference]: With dead ends: 861 [2022-03-15 20:13:25,162 INFO L226 Difference]: Without dead ends: 861 [2022-03-15 20:13:25,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:13:25,162 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:25,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 26 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-03-15 20:13:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 801. [2022-03-15 20:13:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 787 states have (on average 2.0292249047013975) internal successors, (1597), 800 states have internal predecessors, (1597), 0 states have call successors, (0), 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-03-15 20:13:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1597 transitions. [2022-03-15 20:13:25,174 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1597 transitions. Word has length 14 [2022-03-15 20:13:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:25,175 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1597 transitions. [2022-03-15 20:13:25,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-15 20:13:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1597 transitions. [2022-03-15 20:13:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:13:25,175 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:25,175 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:25,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:13:25,176 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash -634040024, now seen corresponding path program 1 times [2022-03-15 20:13:25,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:25,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418085737] [2022-03-15 20:13:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:25,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418085737] [2022-03-15 20:13:25,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418085737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:25,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650315600] [2022-03-15 20:13:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:25,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:25,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:25,208 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:25,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:13:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:25,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:13:25,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650315600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:25,333 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:25,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 20:13:25,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72901574] [2022-03-15 20:13:25,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:25,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:25,338 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2022-03-15 20:13:25,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:25,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:25,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:25,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:13:25,339 INFO L87 Difference]: Start difference. First operand 801 states and 1597 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:13:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:25,368 INFO L93 Difference]: Finished difference Result 802 states and 1598 transitions. [2022-03-15 20:13:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:13:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:25,371 INFO L225 Difference]: With dead ends: 802 [2022-03-15 20:13:25,371 INFO L226 Difference]: Without dead ends: 802 [2022-03-15 20:13:25,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:13:25,372 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:25,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-03-15 20:13:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-03-15 20:13:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 788 states have (on average 2.027918781725888) internal successors, (1598), 801 states have internal predecessors, (1598), 0 states have call successors, (0), 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-03-15 20:13:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1598 transitions. [2022-03-15 20:13:25,384 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1598 transitions. Word has length 20 [2022-03-15 20:13:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:25,384 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1598 transitions. [2022-03-15 20:13:25,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:13:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1598 transitions. [2022-03-15 20:13:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:13:25,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:25,384 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:25,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:25,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:25,601 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 391975570, now seen corresponding path program 2 times [2022-03-15 20:13:25,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:25,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737369667] [2022-03-15 20:13:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:25,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737369667] [2022-03-15 20:13:25,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737369667] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:25,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173188436] [2022-03-15 20:13:25,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:25,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:25,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:25,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:25,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:13:25,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:25,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:25,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:13:25,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:25,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:25,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:25,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,782 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:25,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:25,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:13:25,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:25,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173188436] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:25,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:25,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-03-15 20:13:25,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670857882] [2022-03-15 20:13:25,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:25,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:25,833 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:13:25,833 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:25,834 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:25,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:25,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:25,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:25,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:13:25,834 INFO L87 Difference]: Start difference. First operand 802 states and 1598 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-03-15 20:13:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:26,160 INFO L93 Difference]: Finished difference Result 1463 states and 2920 transitions. [2022-03-15 20:13:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 21 [2022-03-15 20:13:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:26,165 INFO L225 Difference]: With dead ends: 1463 [2022-03-15 20:13:26,165 INFO L226 Difference]: Without dead ends: 1463 [2022-03-15 20:13:26,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:13:26,166 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 198 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:26,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 75 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-03-15 20:13:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 972. [2022-03-15 20:13:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 958 states have (on average 2.0396659707724427) internal successors, (1954), 971 states have internal predecessors, (1954), 0 states have call successors, (0), 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-03-15 20:13:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1954 transitions. [2022-03-15 20:13:26,182 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1954 transitions. Word has length 21 [2022-03-15 20:13:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:26,182 INFO L470 AbstractCegarLoop]: Abstraction has 972 states and 1954 transitions. [2022-03-15 20:13:26,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-03-15 20:13:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1954 transitions. [2022-03-15 20:13:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:13:26,182 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:26,182 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:26,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:26,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,395 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1727558383, now seen corresponding path program 1 times [2022-03-15 20:13:26,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:26,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303096817] [2022-03-15 20:13:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:26,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303096817] [2022-03-15 20:13:26,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303096817] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:26,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819837657] [2022-03-15 20:13:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:26,448 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:26,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:13:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:26,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:13:26,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819837657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:26,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:26,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 20:13:26,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065153551] [2022-03-15 20:13:26,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:26,608 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:26,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:13:26,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:26,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:26,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:13:26,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:13:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:13:26,612 INFO L87 Difference]: Start difference. First operand 972 states and 1954 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 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-03-15 20:13:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:26,654 INFO L93 Difference]: Finished difference Result 973 states and 1955 transitions. [2022-03-15 20:13:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:13:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:13:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:26,657 INFO L225 Difference]: With dead ends: 973 [2022-03-15 20:13:26,657 INFO L226 Difference]: Without dead ends: 973 [2022-03-15 20:13:26,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:13:26,657 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:26,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-03-15 20:13:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2022-03-15 20:13:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 959 states have (on average 2.0385818561001043) internal successors, (1955), 972 states have internal predecessors, (1955), 0 states have call successors, (0), 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-03-15 20:13:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1955 transitions. [2022-03-15 20:13:26,672 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1955 transitions. Word has length 21 [2022-03-15 20:13:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:26,672 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1955 transitions. [2022-03-15 20:13:26,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 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-03-15 20:13:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1955 transitions. [2022-03-15 20:13:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:13:26,672 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:26,672 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:26,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:26,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,892 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 14153959, now seen corresponding path program 2 times [2022-03-15 20:13:26,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:26,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889931963] [2022-03-15 20:13:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:26,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889931963] [2022-03-15 20:13:26,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889931963] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:26,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816598926] [2022-03-15 20:13:26,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:26,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:26,952 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:26,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:13:27,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:27,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:27,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:13:27,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:27,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:27,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:27,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:27,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:27,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:27,153 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:27,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 20:13:27,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:27,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816598926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:27,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:27,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2022-03-15 20:13:27,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1094203873] [2022-03-15 20:13:27,172 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:27,174 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:27,177 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2022-03-15 20:13:27,177 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:27,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:27,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:27,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:27,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:27,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:27,178 INFO L87 Difference]: Start difference. First operand 973 states and 1955 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-03-15 20:13:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:27,660 INFO L93 Difference]: Finished difference Result 2088 states and 4198 transitions. [2022-03-15 20:13:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 22 [2022-03-15 20:13:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:27,667 INFO L225 Difference]: With dead ends: 2088 [2022-03-15 20:13:27,667 INFO L226 Difference]: Without dead ends: 2088 [2022-03-15 20:13:27,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:13:27,667 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 229 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:27,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 76 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:13:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2022-03-15 20:13:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1649. [2022-03-15 20:13:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1635 states have (on average 2.0458715596330275) internal successors, (3345), 1648 states have internal predecessors, (3345), 0 states have call successors, (0), 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-03-15 20:13:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 3345 transitions. [2022-03-15 20:13:27,719 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 3345 transitions. Word has length 22 [2022-03-15 20:13:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:27,720 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 3345 transitions. [2022-03-15 20:13:27,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-03-15 20:13:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 3345 transitions. [2022-03-15 20:13:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:13:27,720 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:27,720 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:27,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:27,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:13:27,943 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash 248252483, now seen corresponding path program 1 times [2022-03-15 20:13:27,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:27,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351442073] [2022-03-15 20:13:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:28,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:28,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351442073] [2022-03-15 20:13:28,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351442073] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:28,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017832424] [2022-03-15 20:13:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:28,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:28,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:28,033 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:28,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:13:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:28,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:13:28,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:28,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:28,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017832424] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:28,223 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:28,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 20:13:28,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24555571] [2022-03-15 20:13:28,223 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:28,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:28,234 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 82 transitions. [2022-03-15 20:13:28,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:28,346 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:28,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:13:28,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:13:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:13:28,347 INFO L87 Difference]: Start difference. First operand 1649 states and 3345 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-03-15 20:13:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:28,403 INFO L93 Difference]: Finished difference Result 1650 states and 3346 transitions. [2022-03-15 20:13:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:13:28,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:13:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:28,409 INFO L225 Difference]: With dead ends: 1650 [2022-03-15 20:13:28,409 INFO L226 Difference]: Without dead ends: 1650 [2022-03-15 20:13:28,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:13:28,410 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:28,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-03-15 20:13:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-03-15 20:13:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1636 states have (on average 2.045232273838631) internal successors, (3346), 1649 states have internal predecessors, (3346), 0 states have call successors, (0), 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-03-15 20:13:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 3346 transitions. [2022-03-15 20:13:28,437 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 3346 transitions. Word has length 26 [2022-03-15 20:13:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:28,437 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 3346 transitions. [2022-03-15 20:13:28,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-03-15 20:13:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3346 transitions. [2022-03-15 20:13:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:13:28,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:28,438 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:28,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:28,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:28,655 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:28,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash 213094957, now seen corresponding path program 2 times [2022-03-15 20:13:28,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:28,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126926448] [2022-03-15 20:13:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:28,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:28,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126926448] [2022-03-15 20:13:28,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126926448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:28,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765064891] [2022-03-15 20:13:28,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:28,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:28,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:28,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:28,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:13:28,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:28,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:28,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 20:13:28,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:28,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:13:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 20:13:28,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:28,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765064891] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:28,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:28,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-03-15 20:13:28,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787726382] [2022-03-15 20:13:28,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:28,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:28,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 83 transitions. [2022-03-15 20:13:28,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:29,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [33815#(and (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |~#cache~0.base| 1)), 33814#(and (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 1) (= |~#cache~0.base| 1))] [2022-03-15 20:13:29,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:13:29,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:13:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:29,269 INFO L87 Difference]: Start difference. First operand 1650 states and 3346 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 20:13:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:29,563 INFO L93 Difference]: Finished difference Result 2723 states and 5407 transitions. [2022-03-15 20:13:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:13:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:13:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:29,573 INFO L225 Difference]: With dead ends: 2723 [2022-03-15 20:13:29,573 INFO L226 Difference]: Without dead ends: 2723 [2022-03-15 20:13:29,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:13:29,574 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 232 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:29,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 278 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2022-03-15 20:13:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 1526. [2022-03-15 20:13:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1512 states have (on average 2.0264550264550265) internal successors, (3064), 1525 states have internal predecessors, (3064), 0 states have call successors, (0), 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-03-15 20:13:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 3064 transitions. [2022-03-15 20:13:29,611 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 3064 transitions. Word has length 27 [2022-03-15 20:13:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:29,611 INFO L470 AbstractCegarLoop]: Abstraction has 1526 states and 3064 transitions. [2022-03-15 20:13:29,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 20:13:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 3064 transitions. [2022-03-15 20:13:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:13:29,613 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:29,613 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:29,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:29,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:13:29,827 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1293353368, now seen corresponding path program 1 times [2022-03-15 20:13:29,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:29,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627378184] [2022-03-15 20:13:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 20:13:29,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:29,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627378184] [2022-03-15 20:13:29,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627378184] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:29,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332892033] [2022-03-15 20:13:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:29,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:29,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:13:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:29,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:13:29,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:13:30,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:13:30,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332892033] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:30,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:30,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2022-03-15 20:13:30,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205225802] [2022-03-15 20:13:30,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:30,127 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:30,132 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 30 transitions. [2022-03-15 20:13:30,132 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:30,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:30,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:13:30,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:13:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:13:30,133 INFO L87 Difference]: Start difference. First operand 1526 states and 3064 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-03-15 20:13:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:30,182 INFO L93 Difference]: Finished difference Result 2251 states and 4504 transitions. [2022-03-15 20:13:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:13:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 30 [2022-03-15 20:13:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:30,189 INFO L225 Difference]: With dead ends: 2251 [2022-03-15 20:13:30,189 INFO L226 Difference]: Without dead ends: 2251 [2022-03-15 20:13:30,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:13:30,190 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 84 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:30,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2022-03-15 20:13:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 1665. [2022-03-15 20:13:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1651 states have (on average 2.03694730466384) internal successors, (3363), 1664 states have internal predecessors, (3363), 0 states have call successors, (0), 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-03-15 20:13:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3363 transitions. [2022-03-15 20:13:30,220 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3363 transitions. Word has length 30 [2022-03-15 20:13:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:30,220 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 3363 transitions. [2022-03-15 20:13:30,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-03-15 20:13:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3363 transitions. [2022-03-15 20:13:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 20:13:30,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:30,221 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:30,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:30,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:13:30,438 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:30,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1391021420, now seen corresponding path program 1 times [2022-03-15 20:13:30,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:30,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887899703] [2022-03-15 20:13:30,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:30,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:30,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887899703] [2022-03-15 20:13:30,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887899703] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:30,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243398508] [2022-03-15 20:13:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:30,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:30,518 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:30,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:13:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:30,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:13:30,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:30,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:30,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243398508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:30,739 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:30,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2022-03-15 20:13:30,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [147279377] [2022-03-15 20:13:30,739 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:30,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:30,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 31 transitions. [2022-03-15 20:13:30,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:30,766 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:30,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:30,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:30,767 INFO L87 Difference]: Start difference. First operand 1665 states and 3363 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-03-15 20:13:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:30,795 INFO L93 Difference]: Finished difference Result 1666 states and 3364 transitions. [2022-03-15 20:13:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:13:30,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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 31 [2022-03-15 20:13:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:30,801 INFO L225 Difference]: With dead ends: 1666 [2022-03-15 20:13:30,801 INFO L226 Difference]: Without dead ends: 1666 [2022-03-15 20:13:30,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:30,801 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:30,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-03-15 20:13:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-03-15 20:13:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1652 states have (on average 2.036319612590799) internal successors, (3364), 1665 states have internal predecessors, (3364), 0 states have call successors, (0), 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-03-15 20:13:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 3364 transitions. [2022-03-15 20:13:30,828 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 3364 transitions. Word has length 31 [2022-03-15 20:13:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:30,828 INFO L470 AbstractCegarLoop]: Abstraction has 1666 states and 3364 transitions. [2022-03-15 20:13:30,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-03-15 20:13:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 3364 transitions. [2022-03-15 20:13:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 20:13:30,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:30,829 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:30,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:31,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:13:31,043 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1151165890, now seen corresponding path program 2 times [2022-03-15 20:13:31,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:31,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127385271] [2022-03-15 20:13:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:31,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:31,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127385271] [2022-03-15 20:13:31,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127385271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:31,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564344411] [2022-03-15 20:13:31,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:31,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:31,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:31,120 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:31,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:13:31,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:31,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:31,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:13:31,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:31,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:31,275 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 20:13:31,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:31,299 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 20:13:31,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:31,352 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:13:31,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-03-15 20:13:31,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:31,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564344411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:31,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:31,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-03-15 20:13:31,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729151802] [2022-03-15 20:13:31,383 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:31,387 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:31,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 32 transitions. [2022-03-15 20:13:31,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:31,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:31,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:31,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:13:31,393 INFO L87 Difference]: Start difference. First operand 1666 states and 3364 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 20:13:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:31,577 INFO L93 Difference]: Finished difference Result 1783 states and 3597 transitions. [2022-03-15 20:13:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 32 [2022-03-15 20:13:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:31,583 INFO L225 Difference]: With dead ends: 1783 [2022-03-15 20:13:31,583 INFO L226 Difference]: Without dead ends: 1783 [2022-03-15 20:13:31,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:13:31,583 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:31,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 26 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-03-15 20:13:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1711. [2022-03-15 20:13:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1698 states have (on average 2.0335689045936394) internal successors, (3453), 1710 states have internal predecessors, (3453), 0 states have call successors, (0), 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-03-15 20:13:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 3453 transitions. [2022-03-15 20:13:31,613 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 3453 transitions. Word has length 32 [2022-03-15 20:13:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:31,614 INFO L470 AbstractCegarLoop]: Abstraction has 1711 states and 3453 transitions. [2022-03-15 20:13:31,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 20:13:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 3453 transitions. [2022-03-15 20:13:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 20:13:31,615 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:31,615 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:31,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:31,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:13:31,854 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash 57219298, now seen corresponding path program 1 times [2022-03-15 20:13:31,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:31,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094918345] [2022-03-15 20:13:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:31,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:31,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094918345] [2022-03-15 20:13:31,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094918345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:31,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235492029] [2022-03-15 20:13:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:31,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:31,941 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:31,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:13:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:32,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:13:32,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:32,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:32,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235492029] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:32,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:32,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 20:13:32,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312564592] [2022-03-15 20:13:32,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:32,164 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:32,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 38 transitions. [2022-03-15 20:13:32,196 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:32,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:32,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:32,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:32,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:32,197 INFO L87 Difference]: Start difference. First operand 1711 states and 3453 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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-03-15 20:13:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:32,232 INFO L93 Difference]: Finished difference Result 1712 states and 3454 transitions. [2022-03-15 20:13:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-03-15 20:13:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:32,236 INFO L225 Difference]: With dead ends: 1712 [2022-03-15 20:13:32,236 INFO L226 Difference]: Without dead ends: 1712 [2022-03-15 20:13:32,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:32,237 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:32,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-03-15 20:13:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2022-03-15 20:13:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1699 states have (on average 2.0329605650382576) internal successors, (3454), 1711 states have internal predecessors, (3454), 0 states have call successors, (0), 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-03-15 20:13:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 3454 transitions. [2022-03-15 20:13:32,260 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 3454 transitions. Word has length 38 [2022-03-15 20:13:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:32,260 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 3454 transitions. [2022-03-15 20:13:32,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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-03-15 20:13:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 3454 transitions. [2022-03-15 20:13:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 20:13:32,260 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:32,260 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:32,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:32,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:32,489 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2129718324, now seen corresponding path program 2 times [2022-03-15 20:13:32,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:32,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483528609] [2022-03-15 20:13:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:32,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:32,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483528609] [2022-03-15 20:13:32,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483528609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:32,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720171502] [2022-03-15 20:13:32,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:32,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:32,610 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:32,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:13:32,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:32,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:32,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:13:32,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:32,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:32,804 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 20:13:32,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:32,832 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 20:13:32,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:32,872 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:13:32,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:13:32,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:32,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720171502] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:32,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:32,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2022-03-15 20:13:32,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104563686] [2022-03-15 20:13:32,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:32,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:32,905 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 39 transitions. [2022-03-15 20:13:32,905 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:32,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:32,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:32,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:32,906 INFO L87 Difference]: Start difference. First operand 1712 states and 3454 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 20:13:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:33,073 INFO L93 Difference]: Finished difference Result 1851 states and 3737 transitions. [2022-03-15 20:13:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:33,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 39 [2022-03-15 20:13:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:33,077 INFO L225 Difference]: With dead ends: 1851 [2022-03-15 20:13:33,077 INFO L226 Difference]: Without dead ends: 1851 [2022-03-15 20:13:33,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:33,078 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:33,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 26 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2022-03-15 20:13:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1798. [2022-03-15 20:13:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1785 states have (on average 2.033613445378151) internal successors, (3630), 1797 states have internal predecessors, (3630), 0 states have call successors, (0), 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-03-15 20:13:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 3630 transitions. [2022-03-15 20:13:33,132 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 3630 transitions. Word has length 39 [2022-03-15 20:13:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:33,132 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 3630 transitions. [2022-03-15 20:13:33,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 20:13:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3630 transitions. [2022-03-15 20:13:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 20:13:33,133 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:33,133 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:33,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:33,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:13:33,347 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash -697527171, now seen corresponding path program 1 times [2022-03-15 20:13:33,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:33,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190932317] [2022-03-15 20:13:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:33,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:33,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190932317] [2022-03-15 20:13:33,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190932317] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:33,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618267264] [2022-03-15 20:13:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:33,456 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:33,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:13:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:33,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:13:33,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:33,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:33,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618267264] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:33,726 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:33,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2022-03-15 20:13:33,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090250810] [2022-03-15 20:13:33,727 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:33,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:33,746 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 39 transitions. [2022-03-15 20:13:33,746 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:33,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:33,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:13:33,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:13:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:33,747 INFO L87 Difference]: Start difference. First operand 1798 states and 3630 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:13:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:33,779 INFO L93 Difference]: Finished difference Result 1799 states and 3631 transitions. [2022-03-15 20:13:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:13:33,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-03-15 20:13:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:33,783 INFO L225 Difference]: With dead ends: 1799 [2022-03-15 20:13:33,783 INFO L226 Difference]: Without dead ends: 1799 [2022-03-15 20:13:33,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:33,784 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:33,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-03-15 20:13:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2022-03-15 20:13:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1786 states have (on average 2.0330347144456886) internal successors, (3631), 1798 states have internal predecessors, (3631), 0 states have call successors, (0), 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-03-15 20:13:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 3631 transitions. [2022-03-15 20:13:33,812 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 3631 transitions. Word has length 39 [2022-03-15 20:13:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:33,813 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 3631 transitions. [2022-03-15 20:13:33,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:13:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3631 transitions. [2022-03-15 20:13:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 20:13:33,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:33,813 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:33,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:34,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:13:34,031 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 226883283, now seen corresponding path program 2 times [2022-03-15 20:13:34,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:34,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250237611] [2022-03-15 20:13:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:34,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:34,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250237611] [2022-03-15 20:13:34,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250237611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:34,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108443985] [2022-03-15 20:13:34,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:34,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:34,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:34,112 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:34,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:13:34,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:34,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:34,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:13:34,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:34,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:34,274 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 20:13:34,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:34,302 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 20:13:34,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:34,342 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:13:34,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-03-15 20:13:34,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:34,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108443985] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:34,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:34,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2022-03-15 20:13:34,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242757508] [2022-03-15 20:13:34,363 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:34,369 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:34,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 40 transitions. [2022-03-15 20:13:34,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:34,378 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:34,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:34,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:13:34,379 INFO L87 Difference]: Start difference. First operand 1799 states and 3631 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 20:13:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:34,729 INFO L93 Difference]: Finished difference Result 2065 states and 4169 transitions. [2022-03-15 20:13:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 40 [2022-03-15 20:13:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:34,733 INFO L225 Difference]: With dead ends: 2065 [2022-03-15 20:13:34,733 INFO L226 Difference]: Without dead ends: 2032 [2022-03-15 20:13:34,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:13:34,736 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:34,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 27 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-03-15 20:13:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1813. [2022-03-15 20:13:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1800 states have (on average 2.0588888888888888) internal successors, (3706), 1812 states have internal predecessors, (3706), 0 states have call successors, (0), 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-03-15 20:13:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 3706 transitions. [2022-03-15 20:13:34,766 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 3706 transitions. Word has length 40 [2022-03-15 20:13:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:34,766 INFO L470 AbstractCegarLoop]: Abstraction has 1813 states and 3706 transitions. [2022-03-15 20:13:34,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 20:13:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3706 transitions. [2022-03-15 20:13:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 20:13:34,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:34,768 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:34,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:34,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:34,985 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:34,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash -546174377, now seen corresponding path program 1 times [2022-03-15 20:13:34,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:34,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054589082] [2022-03-15 20:13:34,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:34,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:35,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:35,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054589082] [2022-03-15 20:13:35,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054589082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:35,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947235212] [2022-03-15 20:13:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:35,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:35,078 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:35,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:13:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:35,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:13:35,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:35,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:35,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947235212] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:35,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:35,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2022-03-15 20:13:35,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241124974] [2022-03-15 20:13:35,339 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:35,364 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:35,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 128 transitions. [2022-03-15 20:13:35,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:35,523 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:35,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:13:35,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:35,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:13:35,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:35,524 INFO L87 Difference]: Start difference. First operand 1813 states and 3706 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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-03-15 20:13:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:35,561 INFO L93 Difference]: Finished difference Result 1814 states and 3707 transitions. [2022-03-15 20:13:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:13:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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 44 [2022-03-15 20:13:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:35,564 INFO L225 Difference]: With dead ends: 1814 [2022-03-15 20:13:35,564 INFO L226 Difference]: Without dead ends: 1814 [2022-03-15 20:13:35,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:35,566 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:35,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2022-03-15 20:13:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1814. [2022-03-15 20:13:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1801 states have (on average 2.0583009439200444) internal successors, (3707), 1813 states have internal predecessors, (3707), 0 states have call successors, (0), 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-03-15 20:13:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 3707 transitions. [2022-03-15 20:13:35,588 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 3707 transitions. Word has length 44 [2022-03-15 20:13:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:35,588 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 3707 transitions. [2022-03-15 20:13:35,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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-03-15 20:13:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 3707 transitions. [2022-03-15 20:13:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:35,589 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:35,589 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:35,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 20:13:35,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:35,803 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -39408191, now seen corresponding path program 2 times [2022-03-15 20:13:35,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:35,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144603318] [2022-03-15 20:13:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:36,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:36,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144603318] [2022-03-15 20:13:36,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144603318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:36,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369850544] [2022-03-15 20:13:36,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:36,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:36,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:36,046 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:36,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:13:36,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:36,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:36,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:13:36,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:36,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:13:36,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:36,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:36,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:36,614 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:13:36,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:13:36,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-15 20:13:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:36,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:37,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:13:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:37,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369850544] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:37,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:13:37,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-03-15 20:13:37,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58106692] [2022-03-15 20:13:37,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:37,474 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:37,539 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 129 transitions. [2022-03-15 20:13:37,539 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:38,315 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [84276#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |~#cache~0.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))))] [2022-03-15 20:13:38,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:38,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:38,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:13:38,317 INFO L87 Difference]: Start difference. First operand 1814 states and 3707 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 20:13:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:38,966 INFO L93 Difference]: Finished difference Result 2853 states and 5820 transitions. [2022-03-15 20:13:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:13:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-03-15 20:13:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:38,971 INFO L225 Difference]: With dead ends: 2853 [2022-03-15 20:13:38,971 INFO L226 Difference]: Without dead ends: 2853 [2022-03-15 20:13:38,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:13:38,972 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 123 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1265 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:38,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 51 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 1265 Unchecked, 0.2s Time] [2022-03-15 20:13:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2022-03-15 20:13:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1860. [2022-03-15 20:13:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1847 states have (on average 2.069842988630211) internal successors, (3823), 1859 states have internal predecessors, (3823), 0 states have call successors, (0), 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-03-15 20:13:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3823 transitions. [2022-03-15 20:13:39,003 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3823 transitions. Word has length 45 [2022-03-15 20:13:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:39,004 INFO L470 AbstractCegarLoop]: Abstraction has 1860 states and 3823 transitions. [2022-03-15 20:13:39,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 20:13:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3823 transitions. [2022-03-15 20:13:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:39,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:39,005 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:39,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:39,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:39,221 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 28515289, now seen corresponding path program 3 times [2022-03-15 20:13:39,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:39,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681253811] [2022-03-15 20:13:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:13:39,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:39,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681253811] [2022-03-15 20:13:39,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681253811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:39,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100306337] [2022-03-15 20:13:39,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:13:39,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:39,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:39,473 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:39,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:13:39,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:13:39,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:39,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:13:39,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:39,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:13:40,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:40,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:40,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:40,234 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:13:40,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:13:40,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:13:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:40,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:40,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:40,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:41,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:13:41,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:41,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100306337] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:41,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:13:41,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 9] total 27 [2022-03-15 20:13:41,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990577256] [2022-03-15 20:13:41,140 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:41,147 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:41,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 129 transitions. [2022-03-15 20:13:41,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:41,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [91153#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |~#cache~0.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))))] [2022-03-15 20:13:41,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:41,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:41,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:13:41,943 INFO L87 Difference]: Start difference. First operand 1860 states and 3823 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 20:13:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:42,510 INFO L93 Difference]: Finished difference Result 2901 states and 5914 transitions. [2022-03-15 20:13:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:13:42,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-03-15 20:13:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:42,516 INFO L225 Difference]: With dead ends: 2901 [2022-03-15 20:13:42,516 INFO L226 Difference]: Without dead ends: 2901 [2022-03-15 20:13:42,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:13:42,517 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:42,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 51 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 461 Unchecked, 0.2s Time] [2022-03-15 20:13:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-03-15 20:13:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1862. [2022-03-15 20:13:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1849 states have (on average 2.0697674418604652) internal successors, (3827), 1861 states have internal predecessors, (3827), 0 states have call successors, (0), 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-03-15 20:13:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 3827 transitions. [2022-03-15 20:13:42,545 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 3827 transitions. Word has length 45 [2022-03-15 20:13:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:42,545 INFO L470 AbstractCegarLoop]: Abstraction has 1862 states and 3827 transitions. [2022-03-15 20:13:42,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 20:13:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 3827 transitions. [2022-03-15 20:13:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:42,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:42,546 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:42,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:42,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 20:13:42,762 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash 29293699, now seen corresponding path program 4 times [2022-03-15 20:13:42,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:42,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090331825] [2022-03-15 20:13:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:42,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:42,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090331825] [2022-03-15 20:13:42,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090331825] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:42,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828568942] [2022-03-15 20:13:42,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:13:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:43,000 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 20:13:43,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:13:43,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:43,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:13:43,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:43,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:43,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:43,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:43,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:43,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:13:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:44,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:44,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:44,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828568942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:44,797 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:44,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:13:44,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [715282831] [2022-03-15 20:13:44,797 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:44,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:44,835 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 129 transitions. [2022-03-15 20:13:44,835 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:44,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:46,319 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [98097#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 98094#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 98088#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)), 98098#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 98099#(= |t_funThread1of1ForFork0_~i~0#1| 0), 98092#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 98086#(and (= (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (not (= |~#cache~0.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |~#cache~0.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |#race| |~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |~#cache~0.offset|)) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))), 98093#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 98085#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= (select (select |#race| |~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (= (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 98090#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)), 98096#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 98091#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)), 98095#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 98089#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)), 98087#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))))] [2022-03-15 20:13:46,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:13:46,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:46,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:13:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1877, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:13:46,320 INFO L87 Difference]: Start difference. First operand 1862 states and 3827 transitions. Second operand has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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-03-15 20:13:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:50,562 INFO L93 Difference]: Finished difference Result 3043 states and 5995 transitions. [2022-03-15 20:13:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 20:13:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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 45 [2022-03-15 20:13:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:50,567 INFO L225 Difference]: With dead ends: 3043 [2022-03-15 20:13:50,567 INFO L226 Difference]: Without dead ends: 3043 [2022-03-15 20:13:50,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 20:13:50,569 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 630 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 4235 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 4235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:50,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 262 Invalid, 4356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 4235 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 20:13:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-03-15 20:13:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 1946. [2022-03-15 20:13:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1933 states have (on average 2.068804966373513) internal successors, (3999), 1945 states have internal predecessors, (3999), 0 states have call successors, (0), 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-03-15 20:13:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 3999 transitions. [2022-03-15 20:13:50,593 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 3999 transitions. Word has length 45 [2022-03-15 20:13:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:50,593 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 3999 transitions. [2022-03-15 20:13:50,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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-03-15 20:13:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 3999 transitions. [2022-03-15 20:13:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:50,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:50,594 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:50,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:50,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 20:13:50,811 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1804731285, now seen corresponding path program 1 times [2022-03-15 20:13:50,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:50,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692273502] [2022-03-15 20:13:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:50,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:50,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692273502] [2022-03-15 20:13:50,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692273502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:50,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044054601] [2022-03-15 20:13:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:50,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:50,965 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:50,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 20:13:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:51,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:13:51,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:51,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:51,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-03-15 20:13:51,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:51,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:51,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:51,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:51,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:51,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044054601] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:51,818 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:51,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 20:13:51,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145328805] [2022-03-15 20:13:51,818 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:51,824 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:51,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:13:51,848 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:52,266 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [105400#(= |t_funThread1of1ForFork0_~i~0#1| 0), 105403#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 105401#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 105399#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 105398#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 105404#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 105402#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:13:52,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:13:52,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:13:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:13:52,268 INFO L87 Difference]: Start difference. First operand 1946 states and 3999 transitions. Second operand has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 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-03-15 20:13:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:54,374 INFO L93 Difference]: Finished difference Result 3004 states and 5917 transitions. [2022-03-15 20:13:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 20:13:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 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) Word has length 45 [2022-03-15 20:13:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:54,378 INFO L225 Difference]: With dead ends: 3004 [2022-03-15 20:13:54,378 INFO L226 Difference]: Without dead ends: 3004 [2022-03-15 20:13:54,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=908, Invalid=5898, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 20:13:54,380 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 589 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:54,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 225 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:13:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-03-15 20:13:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1946. [2022-03-15 20:13:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1933 states have (on average 2.068804966373513) internal successors, (3999), 1945 states have internal predecessors, (3999), 0 states have call successors, (0), 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-03-15 20:13:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 3999 transitions. [2022-03-15 20:13:54,405 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 3999 transitions. Word has length 45 [2022-03-15 20:13:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:54,405 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 3999 transitions. [2022-03-15 20:13:54,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 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-03-15 20:13:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 3999 transitions. [2022-03-15 20:13:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:54,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:54,406 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:54,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:54,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:54,619 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1704518205, now seen corresponding path program 2 times [2022-03-15 20:13:54,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:54,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000780616] [2022-03-15 20:13:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:54,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:54,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000780616] [2022-03-15 20:13:54,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000780616] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:54,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562529634] [2022-03-15 20:13:54,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:54,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:54,889 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:54,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 20:13:55,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:55,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:55,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:13:55,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:55,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:13:55,315 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:13:55,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:13:55,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:55,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:55,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:55,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-15 20:13:55,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:55,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:55,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:55,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:55,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:55,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:55,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:13:55,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:55,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562529634] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:55,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:13:55,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-03-15 20:13:55,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110411974] [2022-03-15 20:13:55,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:55,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:56,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:13:56,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:56,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [112687#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 112689#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 112688#(and (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 112686#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0)))), 112690#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))))] [2022-03-15 20:13:56,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:13:56,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:56,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:13:56,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:13:56,810 INFO L87 Difference]: Start difference. First operand 1946 states and 3999 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-15 20:13:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:58,236 INFO L93 Difference]: Finished difference Result 3947 states and 8006 transitions. [2022-03-15 20:13:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:13:58,236 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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 45 [2022-03-15 20:13:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:58,261 INFO L225 Difference]: With dead ends: 3947 [2022-03-15 20:13:58,261 INFO L226 Difference]: Without dead ends: 3947 [2022-03-15 20:13:58,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=344, Invalid=1818, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:13:58,262 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 206 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:58,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 47 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 912 Invalid, 0 Unknown, 266 Unchecked, 0.6s Time] [2022-03-15 20:13:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2022-03-15 20:13:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 1989. [2022-03-15 20:13:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1976 states have (on average 2.0673076923076925) internal successors, (4085), 1988 states have internal predecessors, (4085), 0 states have call successors, (0), 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-03-15 20:13:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4085 transitions. [2022-03-15 20:13:58,305 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4085 transitions. Word has length 45 [2022-03-15 20:13:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:58,305 INFO L470 AbstractCegarLoop]: Abstraction has 1989 states and 4085 transitions. [2022-03-15 20:13:58,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-15 20:13:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4085 transitions. [2022-03-15 20:13:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:58,307 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:58,307 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:58,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:58,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:58,523 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:13:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1704369405, now seen corresponding path program 3 times [2022-03-15 20:13:58,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:58,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053164026] [2022-03-15 20:13:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:13:58,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:58,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053164026] [2022-03-15 20:13:58,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053164026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:58,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596014859] [2022-03-15 20:13:58,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:13:58,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:58,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:58,836 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:58,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 20:13:59,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:13:59,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:59,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:13:59,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:59,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:13:59,293 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:13:59,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:13:59,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:13:59,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:13:59,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:13:59,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:59,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:59,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:13:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:59,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:59,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:59,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:00,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:14:00,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:00,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596014859] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:00,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:00,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 9] total 27 [2022-03-15 20:14:00,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062584979] [2022-03-15 20:14:00,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:00,138 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:00,205 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:14:00,205 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:01,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [120951#(and (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 120952#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 120953#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 120950#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 120949#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 3))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))))] [2022-03-15 20:14:01,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:14:01,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:01,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:14:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:14:01,152 INFO L87 Difference]: Start difference. First operand 1989 states and 4085 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-15 20:14:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:02,681 INFO L93 Difference]: Finished difference Result 4090 states and 8298 transitions. [2022-03-15 20:14:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:14:02,681 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:02,686 INFO L225 Difference]: With dead ends: 4090 [2022-03-15 20:14:02,686 INFO L226 Difference]: Without dead ends: 4090 [2022-03-15 20:14:02,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:14:02,690 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 216 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:02,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 49 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 747 Invalid, 0 Unknown, 512 Unchecked, 0.5s Time] [2022-03-15 20:14:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-03-15 20:14:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 2021. [2022-03-15 20:14:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2008 states have (on average 2.066235059760956) internal successors, (4149), 2020 states have internal predecessors, (4149), 0 states have call successors, (0), 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-03-15 20:14:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 4149 transitions. [2022-03-15 20:14:02,766 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 4149 transitions. Word has length 45 [2022-03-15 20:14:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:02,766 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 4149 transitions. [2022-03-15 20:14:02,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-15 20:14:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 4149 transitions. [2022-03-15 20:14:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:02,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:02,767 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:02,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:02,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 20:14:02,984 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1707314715, now seen corresponding path program 4 times [2022-03-15 20:14:02,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:02,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173802092] [2022-03-15 20:14:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:03,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:03,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173802092] [2022-03-15 20:14:03,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173802092] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:03,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188971329] [2022-03-15 20:14:03,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:14:03,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:03,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:03,133 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:03,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 20:14:03,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:14:03,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:03,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:14:03,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:03,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:03,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:03,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-03-15 20:14:03,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:03,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:03,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:03,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:03,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:04,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188971329] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:04,130 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:04,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 20:14:04,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [154384333] [2022-03-15 20:14:04,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:04,137 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:04,163 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:14:04,163 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:04,694 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [129430#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 129428#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 129431#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 129425#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 129427#(= |t_funThread1of1ForFork0_~i~0#1| 0), 129426#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 129429#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:14:04,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:14:04,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:14:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:14:04,695 INFO L87 Difference]: Start difference. First operand 2021 states and 4149 transitions. Second operand has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 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-03-15 20:14:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:06,293 INFO L93 Difference]: Finished difference Result 3103 states and 6115 transitions. [2022-03-15 20:14:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:14:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 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) Word has length 45 [2022-03-15 20:14:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:06,297 INFO L225 Difference]: With dead ends: 3103 [2022-03-15 20:14:06,297 INFO L226 Difference]: Without dead ends: 3103 [2022-03-15 20:14:06,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:14:06,299 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 562 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:06,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 272 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:14:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2022-03-15 20:14:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 2022. [2022-03-15 20:14:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 2009 states have (on average 2.0662020905923346) internal successors, (4151), 2021 states have internal predecessors, (4151), 0 states have call successors, (0), 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-03-15 20:14:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4151 transitions. [2022-03-15 20:14:06,330 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4151 transitions. Word has length 45 [2022-03-15 20:14:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:06,331 INFO L470 AbstractCegarLoop]: Abstraction has 2022 states and 4151 transitions. [2022-03-15 20:14:06,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 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-03-15 20:14:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4151 transitions. [2022-03-15 20:14:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:06,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:06,333 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:06,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 20:14:06,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 20:14:06,549 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1066713697, now seen corresponding path program 5 times [2022-03-15 20:14:06,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:06,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016606007] [2022-03-15 20:14:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:06,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:06,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016606007] [2022-03-15 20:14:06,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016606007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:06,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334631908] [2022-03-15 20:14:06,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:14:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:06,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:06,736 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:06,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 20:14:07,019 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:14:07,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:07,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:14:07,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:07,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:07,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:07,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-03-15 20:14:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:07,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:07,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:07,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:07,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:07,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:07,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:07,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334631908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:07,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:07,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-03-15 20:14:07,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443080290] [2022-03-15 20:14:07,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:07,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:07,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 119 transitions. [2022-03-15 20:14:07,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:08,963 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [136920#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 136922#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 136919#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 136917#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 136918#(<= 0 |t_funThread1of1ForFork0_~i~0#1|), 136916#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 136921#(and (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:14:08,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:14:08,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:14:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:14:08,964 INFO L87 Difference]: Start difference. First operand 2022 states and 4151 transitions. Second operand has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 0 states have call successors, (0), 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-03-15 20:14:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:11,524 INFO L93 Difference]: Finished difference Result 5765 states and 11389 transitions. [2022-03-15 20:14:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:14:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:11,531 INFO L225 Difference]: With dead ends: 5765 [2022-03-15 20:14:11,531 INFO L226 Difference]: Without dead ends: 5765 [2022-03-15 20:14:11,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=991, Invalid=4861, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:14:11,532 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 829 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:11,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [829 Valid, 550 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:14:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2022-03-15 20:14:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 2890. [2022-03-15 20:14:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2877 states have (on average 2.1233924226624956) internal successors, (6109), 2889 states have internal predecessors, (6109), 0 states have call successors, (0), 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-03-15 20:14:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 6109 transitions. [2022-03-15 20:14:11,575 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 6109 transitions. Word has length 45 [2022-03-15 20:14:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:11,575 INFO L470 AbstractCegarLoop]: Abstraction has 2890 states and 6109 transitions. [2022-03-15 20:14:11,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 0 states have call successors, (0), 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-03-15 20:14:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 6109 transitions. [2022-03-15 20:14:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:11,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:11,576 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:11,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:11,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 20:14:11,791 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2073281573, now seen corresponding path program 6 times [2022-03-15 20:14:11,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:11,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316026630] [2022-03-15 20:14:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:11,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:11,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316026630] [2022-03-15 20:14:11,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316026630] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:11,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359314272] [2022-03-15 20:14:11,995 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:14:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:11,997 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:11,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 20:14:12,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 20:14:12,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:12,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:14:12,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:12,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:14:12,319 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:14:12,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:14:12,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:12,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:12,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:12,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:12,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:14:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:12,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:12,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:12,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:13,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:14:13,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:13,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359314272] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:13,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:13,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-03-15 20:14:13,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112736006] [2022-03-15 20:14:13,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:13,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:13,145 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 121 transitions. [2022-03-15 20:14:13,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:14,344 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [148845#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 3))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0)))), 148843#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 148842#(and (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 148841#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 148844#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))))] [2022-03-15 20:14:14,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:14:14,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:14:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:14:14,346 INFO L87 Difference]: Start difference. First operand 2890 states and 6109 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 20:14:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:15,899 INFO L93 Difference]: Finished difference Result 6320 states and 13252 transitions. [2022-03-15 20:14:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:14:15,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:15,907 INFO L225 Difference]: With dead ends: 6320 [2022-03-15 20:14:15,907 INFO L226 Difference]: Without dead ends: 6320 [2022-03-15 20:14:15,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=402, Invalid=1854, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 20:14:15,908 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 168 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:15,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 49 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 892 Invalid, 0 Unknown, 395 Unchecked, 0.5s Time] [2022-03-15 20:14:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6320 states. [2022-03-15 20:14:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6320 to 2915. [2022-03-15 20:14:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2902 states have (on average 2.122329427980703) internal successors, (6159), 2914 states have internal predecessors, (6159), 0 states have call successors, (0), 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-03-15 20:14:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 6159 transitions. [2022-03-15 20:14:15,973 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 6159 transitions. Word has length 45 [2022-03-15 20:14:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:15,973 INFO L470 AbstractCegarLoop]: Abstraction has 2915 states and 6159 transitions. [2022-03-15 20:14:15,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 20:14:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 6159 transitions. [2022-03-15 20:14:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:15,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:15,978 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:16,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:16,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 20:14:16,195 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1981054403, now seen corresponding path program 7 times [2022-03-15 20:14:16,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:16,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179699039] [2022-03-15 20:14:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:16,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:16,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179699039] [2022-03-15 20:14:16,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179699039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:16,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448493199] [2022-03-15 20:14:16,387 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:14:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:16,388 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:16,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 20:14:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:16,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:14:16,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:16,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:16,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:16,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:16,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:16,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:17,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:17,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2022-03-15 20:14:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:17,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:17,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:17,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448493199] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:17,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:17,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:14:17,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1130678220] [2022-03-15 20:14:17,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:17,668 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:17,734 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 121 transitions. [2022-03-15 20:14:17,734 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:18,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [161341#(and (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 161344#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 161345#(= |t_funThread1of1ForFork0_~i~0#1| 0), 161342#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 161339#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))), 161343#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 161340#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:14:18,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:14:18,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:18,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:14:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:14:18,979 INFO L87 Difference]: Start difference. First operand 2915 states and 6159 transitions. Second operand has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 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-03-15 20:14:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:20,918 INFO L93 Difference]: Finished difference Result 4036 states and 8224 transitions. [2022-03-15 20:14:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:14:20,918 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:20,923 INFO L225 Difference]: With dead ends: 4036 [2022-03-15 20:14:20,923 INFO L226 Difference]: Without dead ends: 4036 [2022-03-15 20:14:20,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=516, Invalid=2906, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:14:20,925 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 464 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:20,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 312 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:14:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2022-03-15 20:14:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2899. [2022-03-15 20:14:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2899 states, 2886 states have (on average 2.1226611226611225) internal successors, (6126), 2898 states have internal predecessors, (6126), 0 states have call successors, (0), 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-03-15 20:14:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 6126 transitions. [2022-03-15 20:14:20,962 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 6126 transitions. Word has length 45 [2022-03-15 20:14:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:20,962 INFO L470 AbstractCegarLoop]: Abstraction has 2899 states and 6126 transitions. [2022-03-15 20:14:20,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 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-03-15 20:14:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 6126 transitions. [2022-03-15 20:14:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:20,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:20,964 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:20,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:21,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:21,187 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash 458078166, now seen corresponding path program 1 times [2022-03-15 20:14:21,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:21,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681310406] [2022-03-15 20:14:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:21,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:21,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:21,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681310406] [2022-03-15 20:14:21,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681310406] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:21,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654940361] [2022-03-15 20:14:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:21,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:21,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:21,506 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:21,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 20:14:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:21,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 20:14:21,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:21,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:21,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:21,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:22,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:14:22,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:14:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:14:22,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:14:22,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:22,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:14:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:22,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:23,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:23,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654940361] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:23,620 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:23,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2022-03-15 20:14:23,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965264198] [2022-03-15 20:14:23,620 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:23,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:23,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 107 transitions. [2022-03-15 20:14:23,649 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:24,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [171523#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 171525#(<= 0 |t_funThread1of1ForFork0_~i~0#1|), 171519#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)), 171517#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 171522#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 171516#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 171515#(and (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 171524#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 171521#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)), 171520#(and (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)), 171518#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))] [2022-03-15 20:14:24,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:14:24,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:24,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:14:24,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:14:24,693 INFO L87 Difference]: Start difference. First operand 2899 states and 6126 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 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-03-15 20:14:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:27,958 INFO L93 Difference]: Finished difference Result 5655 states and 11283 transitions. [2022-03-15 20:14:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:14:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:27,964 INFO L225 Difference]: With dead ends: 5655 [2022-03-15 20:14:27,964 INFO L226 Difference]: Without dead ends: 5655 [2022-03-15 20:14:27,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1213, Invalid=5759, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 20:14:27,968 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 923 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 4529 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 4529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:27,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 582 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 4529 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:14:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2022-03-15 20:14:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 2985. [2022-03-15 20:14:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2972 states have (on average 2.119111709286676) internal successors, (6298), 2984 states have internal predecessors, (6298), 0 states have call successors, (0), 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-03-15 20:14:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 6298 transitions. [2022-03-15 20:14:28,009 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 6298 transitions. Word has length 45 [2022-03-15 20:14:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:28,009 INFO L470 AbstractCegarLoop]: Abstraction has 2985 states and 6298 transitions. [2022-03-15 20:14:28,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 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-03-15 20:14:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 6298 transitions. [2022-03-15 20:14:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:28,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:28,010 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:28,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 20:14:28,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:28,219 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2018546105, now seen corresponding path program 1 times [2022-03-15 20:14:28,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:28,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166033330] [2022-03-15 20:14:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:28,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:28,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166033330] [2022-03-15 20:14:28,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166033330] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:28,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114051410] [2022-03-15 20:14:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:28,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:28,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:28,356 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:28,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 20:14:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:28,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:14:28,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:28,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:28,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-03-15 20:14:28,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:28,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:28,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:28,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:29,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114051410] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:29,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:29,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-03-15 20:14:29,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153555835] [2022-03-15 20:14:29,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:29,129 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:29,150 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:14:29,150 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:29,264 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [183527#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 183526#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 183528#(<= 0 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:14:29,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:14:29,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:29,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:14:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:14:29,266 INFO L87 Difference]: Start difference. First operand 2985 states and 6298 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 20:14:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:31,724 INFO L93 Difference]: Finished difference Result 5468 states and 10909 transitions. [2022-03-15 20:14:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 20:14:31,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:31,732 INFO L225 Difference]: With dead ends: 5468 [2022-03-15 20:14:31,732 INFO L226 Difference]: Without dead ends: 5468 [2022-03-15 20:14:31,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1577, Invalid=7165, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 20:14:31,733 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 671 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 3123 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 3123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:31,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 488 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 3123 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:14:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2022-03-15 20:14:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 2994. [2022-03-15 20:14:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2981 states have (on average 2.118752096611875) internal successors, (6316), 2993 states have internal predecessors, (6316), 0 states have call successors, (0), 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-03-15 20:14:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 6316 transitions. [2022-03-15 20:14:31,785 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 6316 transitions. Word has length 45 [2022-03-15 20:14:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:31,785 INFO L470 AbstractCegarLoop]: Abstraction has 2994 states and 6316 transitions. [2022-03-15 20:14:31,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 20:14:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 6316 transitions. [2022-03-15 20:14:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:31,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:31,786 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:31,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 20:14:31,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 20:14:31,999 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2134500365, now seen corresponding path program 2 times [2022-03-15 20:14:32,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:32,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197656360] [2022-03-15 20:14:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:32,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:32,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197656360] [2022-03-15 20:14:32,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197656360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:32,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778526792] [2022-03-15 20:14:32,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:14:32,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:32,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:32,183 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:32,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 20:14:32,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:14:32,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:32,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:14:32,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:32,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:14:32,540 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:14:32,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:14:32,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:32,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:32,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-15 20:14:32,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:32,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:32,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:32,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:32,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:33,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:14:33,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:33,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778526792] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:33,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:33,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 25 [2022-03-15 20:14:33,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73730306] [2022-03-15 20:14:33,116 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:33,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:33,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:14:33,144 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:33,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [195403#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))))] [2022-03-15 20:14:33,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:14:33,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:14:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:14:33,377 INFO L87 Difference]: Start difference. First operand 2994 states and 6316 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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-03-15 20:14:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:34,057 INFO L93 Difference]: Finished difference Result 6186 states and 13026 transitions. [2022-03-15 20:14:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:14:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:34,065 INFO L225 Difference]: With dead ends: 6186 [2022-03-15 20:14:34,065 INFO L226 Difference]: Without dead ends: 6186 [2022-03-15 20:14:34,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:14:34,066 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 168 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:34,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 36 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 425 Invalid, 0 Unknown, 335 Unchecked, 0.3s Time] [2022-03-15 20:14:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6186 states. [2022-03-15 20:14:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6186 to 3048. [2022-03-15 20:14:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3035 states have (on average 2.1166392092257) internal successors, (6424), 3047 states have internal predecessors, (6424), 0 states have call successors, (0), 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-03-15 20:14:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 6424 transitions. [2022-03-15 20:14:34,112 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 6424 transitions. Word has length 45 [2022-03-15 20:14:34,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:34,112 INFO L470 AbstractCegarLoop]: Abstraction has 3048 states and 6424 transitions. [2022-03-15 20:14:34,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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-03-15 20:14:34,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 6424 transitions. [2022-03-15 20:14:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:34,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:34,113 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:34,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:34,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:34,327 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2134524545, now seen corresponding path program 3 times [2022-03-15 20:14:34,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:34,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833116687] [2022-03-15 20:14:34,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:34,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:34,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833116687] [2022-03-15 20:14:34,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833116687] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:34,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677949099] [2022-03-15 20:14:34,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:14:34,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:34,527 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:34,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 20:14:34,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:14:34,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:34,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:14:34,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:34,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:14:34,952 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:14:34,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:14:35,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:35,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:35,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:35,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:35,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:14:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:35,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:35,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:35,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:14:35,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:35,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677949099] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:35,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:35,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-03-15 20:14:35,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916176147] [2022-03-15 20:14:35,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:35,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:35,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:14:35,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:36,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [208002#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 3))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))))] [2022-03-15 20:14:36,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:14:36,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:14:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:14:36,031 INFO L87 Difference]: Start difference. First operand 3048 states and 6424 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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-03-15 20:14:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:36,748 INFO L93 Difference]: Finished difference Result 5377 states and 11314 transitions. [2022-03-15 20:14:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:14:36,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:36,756 INFO L225 Difference]: With dead ends: 5377 [2022-03-15 20:14:36,756 INFO L226 Difference]: Without dead ends: 5377 [2022-03-15 20:14:36,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:14:36,757 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 107 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:36,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 46 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 168 Unchecked, 0.1s Time] [2022-03-15 20:14:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2022-03-15 20:14:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 3056. [2022-03-15 20:14:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 3043 states have (on average 2.1163325665461716) internal successors, (6440), 3055 states have internal predecessors, (6440), 0 states have call successors, (0), 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-03-15 20:14:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 6440 transitions. [2022-03-15 20:14:36,824 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 6440 transitions. Word has length 45 [2022-03-15 20:14:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:36,824 INFO L470 AbstractCegarLoop]: Abstraction has 3056 states and 6440 transitions. [2022-03-15 20:14:36,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 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-03-15 20:14:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 6440 transitions. [2022-03-15 20:14:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:36,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:36,825 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:36,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 20:14:37,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:37,040 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2132943545, now seen corresponding path program 4 times [2022-03-15 20:14:37,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:37,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131340752] [2022-03-15 20:14:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:37,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:37,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131340752] [2022-03-15 20:14:37,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131340752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:37,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274288100] [2022-03-15 20:14:37,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:14:37,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:37,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:37,240 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:37,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 20:14:37,564 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:14:37,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:37,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 20:14:37,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:37,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:37,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-03-15 20:14:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:37,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:37,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:37,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:38,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:38,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274288100] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:38,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:38,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 20:14:38,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365319397] [2022-03-15 20:14:38,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:38,196 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:38,219 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:14:38,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:38,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [219806#(= |t_funThread1of1ForFork0_~i~0#1| 0), 219805#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 219804#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))] [2022-03-15 20:14:38,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:14:38,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:14:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:14:38,386 INFO L87 Difference]: Start difference. First operand 3056 states and 6440 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-15 20:14:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:39,420 INFO L93 Difference]: Finished difference Result 3994 states and 8212 transitions. [2022-03-15 20:14:39,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:14:39,420 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:39,425 INFO L225 Difference]: With dead ends: 3994 [2022-03-15 20:14:39,425 INFO L226 Difference]: Without dead ends: 3994 [2022-03-15 20:14:39,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:14:39,426 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 381 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:39,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 419 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:14:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2022-03-15 20:14:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3058. [2022-03-15 20:14:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3045 states have (on average 2.116256157635468) internal successors, (6444), 3057 states have internal predecessors, (6444), 0 states have call successors, (0), 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-03-15 20:14:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 6444 transitions. [2022-03-15 20:14:39,491 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 6444 transitions. Word has length 45 [2022-03-15 20:14:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:39,491 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 6444 transitions. [2022-03-15 20:14:39,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-15 20:14:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 6444 transitions. [2022-03-15 20:14:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:39,493 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:39,493 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:39,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:39,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 20:14:39,693 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash 157959221, now seen corresponding path program 5 times [2022-03-15 20:14:39,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:39,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325818586] [2022-03-15 20:14:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:39,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:39,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325818586] [2022-03-15 20:14:39,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325818586] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:39,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92184570] [2022-03-15 20:14:39,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:14:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:39,883 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:39,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 20:14:40,238 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:14:40,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:40,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:14:40,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:40,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:40,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:40,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:40,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-03-15 20:14:40,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:40,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:40,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:40,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:40,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:40,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:40,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:41,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92184570] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:41,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:41,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:14:41,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708422645] [2022-03-15 20:14:41,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:41,206 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:41,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 83 transitions. [2022-03-15 20:14:41,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:41,391 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [230248#(and (<= (+ |~#cache~0.offset| 1) |t_funThread1of1ForFork0_~i~0#1|) (= |~#cache~0.offset| 0)), 230249#(and (= |~#cache~0.offset| |t_funThread1of1ForFork0_~i~0#1|) (= |~#cache~0.offset| 0)), 230247#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ 28 (* |~#cache~0.offset| 29)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |~#cache~0.offset| 0))] [2022-03-15 20:14:41,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:14:41,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:14:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:14:41,392 INFO L87 Difference]: Start difference. First operand 3058 states and 6444 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 20:14:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:42,467 INFO L93 Difference]: Finished difference Result 3986 states and 8196 transitions. [2022-03-15 20:14:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:14:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:42,472 INFO L225 Difference]: With dead ends: 3986 [2022-03-15 20:14:42,472 INFO L226 Difference]: Without dead ends: 3986 [2022-03-15 20:14:42,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=444, Invalid=2418, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:14:42,473 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 513 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:42,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 305 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:14:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-03-15 20:14:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3060. [2022-03-15 20:14:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3047 states have (on average 2.1161798490318344) internal successors, (6448), 3059 states have internal predecessors, (6448), 0 states have call successors, (0), 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-03-15 20:14:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 6448 transitions. [2022-03-15 20:14:42,510 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 6448 transitions. Word has length 45 [2022-03-15 20:14:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:42,510 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 6448 transitions. [2022-03-15 20:14:42,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 20:14:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 6448 transitions. [2022-03-15 20:14:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:42,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:42,511 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:42,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:42,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 20:14:42,729 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 157935041, now seen corresponding path program 6 times [2022-03-15 20:14:42,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:42,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360929440] [2022-03-15 20:14:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:42,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:42,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360929440] [2022-03-15 20:14:42,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360929440] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:42,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675504192] [2022-03-15 20:14:42,938 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:14:42,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:42,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:42,939 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:42,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 20:14:43,172 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 20:14:43,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:43,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:14:43,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:43,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 20:14:43,359 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:14:43,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:14:43,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:43,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:43,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:43,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:43,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:43,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:14:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:43,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:44,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:44,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-15 20:14:44,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:44,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675504192] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:44,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:44,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-03-15 20:14:44,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426455214] [2022-03-15 20:14:44,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:44,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:44,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 85 transitions. [2022-03-15 20:14:44,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:44,466 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [240685#(and (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 3))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))) (or (not (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 1))) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0))))] [2022-03-15 20:14:44,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:14:44,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:14:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:14:44,467 INFO L87 Difference]: Start difference. First operand 3060 states and 6448 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:14:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:45,520 INFO L93 Difference]: Finished difference Result 5984 states and 12586 transitions. [2022-03-15 20:14:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:14:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-03-15 20:14:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:45,527 INFO L225 Difference]: With dead ends: 5984 [2022-03-15 20:14:45,527 INFO L226 Difference]: Without dead ends: 5984 [2022-03-15 20:14:45,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:14:45,533 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 166 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:45,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 46 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 462 Invalid, 0 Unknown, 519 Unchecked, 0.3s Time] [2022-03-15 20:14:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2022-03-15 20:14:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3073. [2022-03-15 20:14:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 3060 states have (on average 2.115686274509804) internal successors, (6474), 3072 states have internal predecessors, (6474), 0 states have call successors, (0), 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-03-15 20:14:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 6474 transitions. [2022-03-15 20:14:45,592 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 6474 transitions. Word has length 45 [2022-03-15 20:14:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:45,592 INFO L470 AbstractCegarLoop]: Abstraction has 3073 states and 6474 transitions. [2022-03-15 20:14:45,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:14:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 6474 transitions. [2022-03-15 20:14:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:45,612 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:45,612 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:45,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:45,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 20:14:45,813 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash 156147581, now seen corresponding path program 7 times [2022-03-15 20:14:45,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:45,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230842704] [2022-03-15 20:14:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:46,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:46,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230842704] [2022-03-15 20:14:46,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230842704] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:46,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203878831] [2022-03-15 20:14:46,023 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:14:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:46,024 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 20:14:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:46,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:14:46,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:46,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:46,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:46,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:46,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:46,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:46,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2022-03-15 20:14:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:46,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:47,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:47,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203878831] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:47,362 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:47,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-03-15 20:14:47,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439647173] [2022-03-15 20:14:47,363 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:47,369 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:47,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 85 transitions. [2022-03-15 20:14:47,396 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:47,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [253138#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |~#cache~0.offset| 28) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 253140#(<= 0 |t_funThread1of1ForFork0_~i~0#1|), 253139#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:14:47,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:14:47,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:47,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:14:47,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:14:47,628 INFO L87 Difference]: Start difference. First operand 3073 states and 6474 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:14:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:49,918 INFO L93 Difference]: Finished difference Result 5518 states and 11009 transitions. [2022-03-15 20:14:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 20:14:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:49,925 INFO L225 Difference]: With dead ends: 5518 [2022-03-15 20:14:49,926 INFO L226 Difference]: Without dead ends: 5518 [2022-03-15 20:14:49,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=700, Invalid=3332, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 20:14:49,927 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 607 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:49,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 512 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:14:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2022-03-15 20:14:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3078. [2022-03-15 20:14:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3065 states have (on average 2.1154975530179447) internal successors, (6484), 3077 states have internal predecessors, (6484), 0 states have call successors, (0), 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-03-15 20:14:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 6484 transitions. [2022-03-15 20:14:49,974 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 6484 transitions. Word has length 45 [2022-03-15 20:14:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:49,974 INFO L470 AbstractCegarLoop]: Abstraction has 3078 states and 6484 transitions. [2022-03-15 20:14:49,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:14:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 6484 transitions. [2022-03-15 20:14:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:49,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:49,976 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:49,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 20:14:50,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:50,192 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:50,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 419370891, now seen corresponding path program 5 times [2022-03-15 20:14:50,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:50,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749948061] [2022-03-15 20:14:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:50,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:50,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749948061] [2022-03-15 20:14:50,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749948061] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:50,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198154007] [2022-03-15 20:14:50,416 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:14:50,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:50,418 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:50,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 20:14:50,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:14:50,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:50,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 20:14:50,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:51,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:51,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:51,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:51,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:51,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:51,209 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-15 20:14:51,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-15 20:14:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:51,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:51,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:51,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198154007] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:51,875 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:51,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:14:51,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764190631] [2022-03-15 20:14:51,875 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:51,880 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:51,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 83 transitions. [2022-03-15 20:14:51,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:52,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [265173#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 265174#(= |t_funThread1of1ForFork0_~i~0#1| 0)] [2022-03-15 20:14:52,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:14:52,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:14:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:14:52,100 INFO L87 Difference]: Start difference. First operand 3078 states and 6484 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-15 20:14:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:53,329 INFO L93 Difference]: Finished difference Result 3904 states and 8017 transitions. [2022-03-15 20:14:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:14:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:53,334 INFO L225 Difference]: With dead ends: 3904 [2022-03-15 20:14:53,334 INFO L226 Difference]: Without dead ends: 3904 [2022-03-15 20:14:53,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=2217, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:14:53,335 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 313 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:53,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 471 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:14:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2022-03-15 20:14:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3050. [2022-03-15 20:14:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 3037 states have (on average 2.115574580177807) internal successors, (6425), 3049 states have internal predecessors, (6425), 0 states have call successors, (0), 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-03-15 20:14:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 6425 transitions. [2022-03-15 20:14:53,381 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 6425 transitions. Word has length 45 [2022-03-15 20:14:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:53,382 INFO L470 AbstractCegarLoop]: Abstraction has 3050 states and 6425 transitions. [2022-03-15 20:14:53,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-15 20:14:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 6425 transitions. [2022-03-15 20:14:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:53,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:53,382 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:53,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:53,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 20:14:53,600 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1428935557, now seen corresponding path program 8 times [2022-03-15 20:14:53,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:53,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404071173] [2022-03-15 20:14:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:53,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:53,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404071173] [2022-03-15 20:14:53,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404071173] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:53,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195786573] [2022-03-15 20:14:53,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:14:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:53,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:53,745 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:53,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 20:14:54,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:14:54,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:54,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:14:54,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:54,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:54,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-15 20:14:54,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:54,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:54,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:54,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:54,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:54,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195786573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:54,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:54,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-03-15 20:14:54,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856624884] [2022-03-15 20:14:54,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:54,614 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:54,633 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 75 transitions. [2022-03-15 20:14:54,633 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:54,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [275507#(<= 0 |t_funThread1of1ForFork0_~i~0#1|), 275506#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:14:54,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:14:54,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:14:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:14:54,705 INFO L87 Difference]: Start difference. First operand 3050 states and 6425 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-15 20:14:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:56,591 INFO L93 Difference]: Finished difference Result 6539 states and 13049 transitions. [2022-03-15 20:14:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 20:14:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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 45 [2022-03-15 20:14:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:56,598 INFO L225 Difference]: With dead ends: 6539 [2022-03-15 20:14:56,598 INFO L226 Difference]: Without dead ends: 6539 [2022-03-15 20:14:56,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1114, Invalid=5048, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:14:56,598 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 626 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 3154 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 3154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:56,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 436 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 3154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:14:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-03-15 20:14:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 3089. [2022-03-15 20:14:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 3076 states have (on average 2.115409622886866) internal successors, (6507), 3088 states have internal predecessors, (6507), 0 states have call successors, (0), 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-03-15 20:14:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 6507 transitions. [2022-03-15 20:14:56,642 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 6507 transitions. Word has length 45 [2022-03-15 20:14:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:56,655 INFO L470 AbstractCegarLoop]: Abstraction has 3089 states and 6507 transitions. [2022-03-15 20:14:56,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-15 20:14:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 6507 transitions. [2022-03-15 20:14:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:56,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:56,656 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:56,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:56,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 20:14:56,871 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:14:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1529148637, now seen corresponding path program 9 times [2022-03-15 20:14:56,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:56,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278233972] [2022-03-15 20:14:56,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:57,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:57,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278233972] [2022-03-15 20:14:57,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278233972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:57,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91780658] [2022-03-15 20:14:57,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:14:57,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:57,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:57,093 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:57,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 20:14:57,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:14:57,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:57,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:14:57,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:57,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:14:57,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:14:57,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:57,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-03-15 20:14:57,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:57,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:14:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:57,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:58,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:58,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:58,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:58,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:58,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91780658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:58,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:58,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-03-15 20:14:58,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585445823] [2022-03-15 20:14:58,197 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:58,202 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:58,220 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 75 transitions. [2022-03-15 20:14:58,220 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:58,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [288618#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 288619#(<= 0 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:14:58,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:14:58,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:58,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:14:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:14:58,303 INFO L87 Difference]: Start difference. First operand 3089 states and 6507 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-15 20:15:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:00,098 INFO L93 Difference]: Finished difference Result 6592 states and 13155 transitions. [2022-03-15 20:15:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:15:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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 45 [2022-03-15 20:15:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:00,106 INFO L225 Difference]: With dead ends: 6592 [2022-03-15 20:15:00,106 INFO L226 Difference]: Without dead ends: 6592 [2022-03-15 20:15:00,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=569, Invalid=2623, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 20:15:00,106 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 575 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:00,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 581 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:15:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2022-03-15 20:15:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 3179. [2022-03-15 20:15:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3166 states have (on average 2.1168667087807957) internal successors, (6702), 3178 states have internal predecessors, (6702), 0 states have call successors, (0), 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-03-15 20:15:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 6702 transitions. [2022-03-15 20:15:00,158 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 6702 transitions. Word has length 45 [2022-03-15 20:15:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:00,158 INFO L470 AbstractCegarLoop]: Abstraction has 3179 states and 6702 transitions. [2022-03-15 20:15:00,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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-03-15 20:15:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 6702 transitions. [2022-03-15 20:15:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:00,159 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:00,159 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:00,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 20:15:00,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:00,375 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:15:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1529297437, now seen corresponding path program 10 times [2022-03-15 20:15:00,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:00,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594342085] [2022-03-15 20:15:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:00,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:00,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594342085] [2022-03-15 20:15:00,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594342085] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:00,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619878264] [2022-03-15 20:15:00,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:15:00,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:00,572 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:00,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 20:15:00,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:15:00,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:15:00,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:15:00,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:01,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:15:01,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:15:01,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:15:01,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:15:01,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:01,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 20:15:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:01,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:01,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:01,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:02,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619878264] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:02,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:02,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:15:02,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654571683] [2022-03-15 20:15:02,022 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:02,026 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:02,045 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 75 transitions. [2022-03-15 20:15:02,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:02,127 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [301918#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 301919#(= |t_funThread1of1ForFork0_~i~0#1| 0)] [2022-03-15 20:15:02,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:15:02,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:15:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:15:02,128 INFO L87 Difference]: Start difference. First operand 3179 states and 6702 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 20:15:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:03,254 INFO L93 Difference]: Finished difference Result 4035 states and 8292 transitions. [2022-03-15 20:15:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:15:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 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 45 [2022-03-15 20:15:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:03,259 INFO L225 Difference]: With dead ends: 4035 [2022-03-15 20:15:03,259 INFO L226 Difference]: Without dead ends: 4035 [2022-03-15 20:15:03,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:15:03,259 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 327 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:03,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 376 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:15:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2022-03-15 20:15:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 3190. [2022-03-15 20:15:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 3177 states have (on average 2.117091595845137) internal successors, (6726), 3189 states have internal predecessors, (6726), 0 states have call successors, (0), 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-03-15 20:15:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 6726 transitions. [2022-03-15 20:15:03,298 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 6726 transitions. Word has length 45 [2022-03-15 20:15:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:03,298 INFO L470 AbstractCegarLoop]: Abstraction has 3190 states and 6726 transitions. [2022-03-15 20:15:03,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 20:15:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 6726 transitions. [2022-03-15 20:15:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:03,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:03,300 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:03,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 20:15:03,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 20:15:03,515 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:15:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 712193358, now seen corresponding path program 2 times [2022-03-15 20:15:03,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:03,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909630400] [2022-03-15 20:15:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:15:03,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:03,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909630400] [2022-03-15 20:15:03,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909630400] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:03,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167006990] [2022-03-15 20:15:03,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:15:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:03,891 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:03,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 20:15:04,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:15:04,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:15:04,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 20:15:04,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:04,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:15:04,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:15:04,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:15:04,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:15:04,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:15:04,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:15:04,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:15:04,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:15:04,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:04,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2022-03-15 20:15:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:04,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:06,646 INFO L353 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-03-15 20:15:06,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29930 treesize of output 29922 [2022-03-15 20:15:07,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:07,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2022-03-15 20:15:07,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:07,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2022-03-15 20:15:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:10,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167006990] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:10,225 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:10,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 35 [2022-03-15 20:15:10,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653835457] [2022-03-15 20:15:10,225 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:10,229 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:10,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 87 transitions. [2022-03-15 20:15:10,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:10,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:10,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [312662#(<= 0 |t_funThread1of1ForFork0_~i~0#1|), 312663#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 3 (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2 (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))))), 312661#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:15:10,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:15:10,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:15:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1241, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:15:10,661 INFO L87 Difference]: Start difference. First operand 3190 states and 6726 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:15:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:15,318 INFO L93 Difference]: Finished difference Result 7534 states and 14921 transitions. [2022-03-15 20:15:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 20:15:15,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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 45 [2022-03-15 20:15:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:15,326 INFO L225 Difference]: With dead ends: 7534 [2022-03-15 20:15:15,326 INFO L226 Difference]: Without dead ends: 7534 [2022-03-15 20:15:15,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1288, Invalid=6194, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 20:15:15,335 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 729 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 4157 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 4157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:15,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 578 Invalid, 4333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 4157 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:15:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2022-03-15 20:15:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 3420. [2022-03-15 20:15:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3420 states, 3407 states have (on average 2.124449662459642) internal successors, (7238), 3419 states have internal predecessors, (7238), 0 states have call successors, (0), 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-03-15 20:15:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 7238 transitions. [2022-03-15 20:15:15,389 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 7238 transitions. Word has length 45 [2022-03-15 20:15:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:15,392 INFO L470 AbstractCegarLoop]: Abstraction has 3420 states and 7238 transitions. [2022-03-15 20:15:15,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:15:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 7238 transitions. [2022-03-15 20:15:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:15,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:15,393 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:15,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 20:15:15,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:15,604 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:15:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1709995261, now seen corresponding path program 8 times [2022-03-15 20:15:15,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:15,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763975684] [2022-03-15 20:15:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:15,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:15,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763975684] [2022-03-15 20:15:15,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763975684] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:15,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860792119] [2022-03-15 20:15:15,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:15:15,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:15,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:15,709 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:15,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 20:15:16,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:15:16,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:15:16,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:15:16,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:16,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:15:16,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-03-15 20:15:16,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:15:16,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:15:16,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:16,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:15:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:16,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:16,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860792119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:16,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:16,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 20:15:16,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595378640] [2022-03-15 20:15:16,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:16,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:16,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:15:16,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:16,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:16,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:16,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:16,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:16,797 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [327427#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 327429#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|))), 327428#(= |t_funThread1of1ForFork0_~i~0#1| 0)] [2022-03-15 20:15:16,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:15:16,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:15:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:15:16,798 INFO L87 Difference]: Start difference. First operand 3420 states and 7238 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:15:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:18,383 INFO L93 Difference]: Finished difference Result 4279 states and 8810 transitions. [2022-03-15 20:15:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 20:15:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 45 [2022-03-15 20:15:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:18,388 INFO L225 Difference]: With dead ends: 4279 [2022-03-15 20:15:18,388 INFO L226 Difference]: Without dead ends: 4279 [2022-03-15 20:15:18,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=643, Invalid=3647, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 20:15:18,389 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 423 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 3159 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:18,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 366 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:15:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2022-03-15 20:15:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 3420. [2022-03-15 20:15:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3420 states, 3407 states have (on average 2.124449662459642) internal successors, (7238), 3419 states have internal predecessors, (7238), 0 states have call successors, (0), 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-03-15 20:15:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 7238 transitions. [2022-03-15 20:15:18,440 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 7238 transitions. Word has length 45 [2022-03-15 20:15:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:18,440 INFO L470 AbstractCegarLoop]: Abstraction has 3420 states and 7238 transitions. [2022-03-15 20:15:18,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:15:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 7238 transitions. [2022-03-15 20:15:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:18,441 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:18,441 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:18,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-15 20:15:18,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:18,655 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:15:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1825949521, now seen corresponding path program 9 times [2022-03-15 20:15:18,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:18,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339294116] [2022-03-15 20:15:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:18,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:18,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339294116] [2022-03-15 20:15:18,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339294116] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:18,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136682231] [2022-03-15 20:15:18,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:15:18,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:18,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:18,834 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:18,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 20:15:19,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:15:19,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:15:19,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:15:19,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:19,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:15:19,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:15:19,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:15:19,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-03-15 20:15:19,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:19,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:15:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:19,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:19,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:19,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:19,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:19,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:20,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136682231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:20,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:20,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 20:15:20,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932915558] [2022-03-15 20:15:20,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:20,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:20,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:15:20,085 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:20,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:20,578 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [338914#(= |t_funThread1of1ForFork0_~i~0#1| 0), 338912#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))))), 338913#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:15:20,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:15:20,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:15:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:15:20,579 INFO L87 Difference]: Start difference. First operand 3420 states and 7238 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:15:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:21,819 INFO L93 Difference]: Finished difference Result 4264 states and 8779 transitions. [2022-03-15 20:15:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:15:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 45 [2022-03-15 20:15:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:21,824 INFO L225 Difference]: With dead ends: 4264 [2022-03-15 20:15:21,824 INFO L226 Difference]: Without dead ends: 4264 [2022-03-15 20:15:21,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=384, Invalid=2066, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:15:21,825 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 400 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:21,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 422 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:15:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2022-03-15 20:15:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3500. [2022-03-15 20:15:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 3487 states have (on average 2.1287639804989964) internal successors, (7423), 3499 states have internal predecessors, (7423), 0 states have call successors, (0), 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-03-15 20:15:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 7423 transitions. [2022-03-15 20:15:21,865 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 7423 transitions. Word has length 45 [2022-03-15 20:15:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:21,865 INFO L470 AbstractCegarLoop]: Abstraction has 3500 states and 7423 transitions. [2022-03-15 20:15:21,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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-03-15 20:15:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 7423 transitions. [2022-03-15 20:15:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:21,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:21,867 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:21,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 20:15:22,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 20:15:22,085 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:15:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1825973701, now seen corresponding path program 10 times [2022-03-15 20:15:22,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:22,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810699264] [2022-03-15 20:15:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:15:22,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:22,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810699264] [2022-03-15 20:15:22,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810699264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:22,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100351233] [2022-03-15 20:15:22,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:15:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:22,312 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:22,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 20:15:22,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:15:22,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:15:22,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 20:15:22,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:22,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:15:22,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:22,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:15:23,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:15:23,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:15:23,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:23,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 20:15:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:23,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:23,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:23,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100351233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:23,770 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:23,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-03-15 20:15:23,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742791430] [2022-03-15 20:15:23,770 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:23,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:23,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:15:23,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:23,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:23,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:23,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:23,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:23,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:24,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:24,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:24,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:24,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:24,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:24,350 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [350507#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))))), 350506#(<= 0 |t_funThread1of1ForFork0_~i~0#1|), 350505#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:15:24,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:15:24,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:15:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:15:24,350 INFO L87 Difference]: Start difference. First operand 3500 states and 7423 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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-03-15 20:15:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:26,948 INFO L93 Difference]: Finished difference Result 7302 states and 14474 transitions. [2022-03-15 20:15:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 20:15:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 45 [2022-03-15 20:15:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:26,958 INFO L225 Difference]: With dead ends: 7302 [2022-03-15 20:15:26,958 INFO L226 Difference]: Without dead ends: 7302 [2022-03-15 20:15:26,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=820, Invalid=3872, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:15:26,959 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 648 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:26,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 638 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:15:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2022-03-15 20:15:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 3570. [2022-03-15 20:15:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3557 states have (on average 2.1355074500983977) internal successors, (7596), 3569 states have internal predecessors, (7596), 0 states have call successors, (0), 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-03-15 20:15:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 7596 transitions. [2022-03-15 20:15:27,017 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 7596 transitions. Word has length 45 [2022-03-15 20:15:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:27,017 INFO L470 AbstractCegarLoop]: Abstraction has 3570 states and 7596 transitions. [2022-03-15 20:15:27,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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-03-15 20:15:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 7596 transitions. [2022-03-15 20:15:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:27,018 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:27,018 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:27,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 20:15:27,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 20:15:27,231 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 20:15:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -400130627, now seen corresponding path program 11 times [2022-03-15 20:15:27,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:27,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521230624] [2022-03-15 20:15:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:27,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:15:27,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:27,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521230624] [2022-03-15 20:15:27,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521230624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:27,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344118208] [2022-03-15 20:15:27,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:15:27,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:27,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:27,577 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:27,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 20:15:28,134 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:15:28,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:15:28,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 20:15:28,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:28,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:15:28,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 20:15:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:15:28,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:15:28,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 20:15:28,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:15:28,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:15:28,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:15:28,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:28,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 88 [2022-03-15 20:15:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:36,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:53,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| Int) (v_ArrVal_5725 Int) (v_ArrVal_5723 Int) (v_ArrVal_5721 Int)) (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1)) (.cse1 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|))) (let ((.cse0 (store (store (store (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)) |c_~#cache~0.base|) .cse8 v_ArrVal_5721) .cse1 v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725))) (or (not (= (select .cse0 .cse1) 0)) (and (forall ((v_ArrVal_5728 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse3 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5728 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((v_ArrVal_5728 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5728 Int)) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (select .cse0 .cse8) 0)))))) is different from false [2022-03-15 20:15:56,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| Int) (v_ArrVal_5725 Int) (v_ArrVal_5723 Int) (v_ArrVal_5721 Int)) (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1)) (.cse9 (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|))) (let ((.cse0 (store (store (store (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)) |c_~#cache~0.base|) .cse1 v_ArrVal_5721) .cse9 v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725))) (or (not (= (select .cse0 .cse1) 0)) (and (forall ((v_ArrVal_5728 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5728 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((v_ArrVal_5728 Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((v_ArrVal_5728 Int)) (= (select (select (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse8 |c_~#cache~0.base| (store (store (store (store (select .cse8 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| 1) v_ArrVal_5721) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5723) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181|) v_ArrVal_5725) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| v_ArrVal_5728))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_181| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (select .cse0 .cse9) 0)))))) is different from false [2022-03-15 20:15:56,274 INFO L353 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-03-15 20:15:56,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 20721 treesize of output 20713 [2022-03-15 20:15:56,874 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 20:15:56,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18180 treesize of output 18172 [2022-03-15 20:15:56,974 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 20:15:56,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 20:15:57,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 20:15:57,194 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) 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:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) 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-03-15 20:15:57,197 INFO L158 Benchmark]: Toolchain (without parser) took 157514.96ms. Allocated memory was 196.1MB in the beginning and 889.2MB in the end (delta: 693.1MB). Free memory was 171.6MB in the beginning and 664.3MB in the end (delta: -492.7MB). Peak memory consumption was 631.5MB. Max. memory is 8.0GB. [2022-03-15 20:15:57,197 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:15:57,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.17ms. Allocated memory is still 196.1MB. Free memory was 171.6MB in the beginning and 152.7MB in the end (delta: 18.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 20:15:57,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.37ms. Allocated memory is still 196.1MB. Free memory was 152.7MB in the beginning and 149.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:15:57,197 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 196.1MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:15:57,197 INFO L158 Benchmark]: RCFGBuilder took 520.37ms. Allocated memory is still 196.1MB. Free memory was 147.8MB in the beginning and 132.1MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 20:15:57,198 INFO L158 Benchmark]: TraceAbstraction took 156412.13ms. Allocated memory was 196.1MB in the beginning and 889.2MB in the end (delta: 693.1MB). Free memory was 131.7MB in the beginning and 664.3MB in the end (delta: -532.6MB). Peak memory consumption was 592.9MB. Max. memory is 8.0GB. [2022-03-15 20:15:57,198 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.10ms. Allocated memory is still 196.1MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.17ms. Allocated memory is still 196.1MB. Free memory was 171.6MB in the beginning and 152.7MB in the end (delta: 18.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.37ms. Allocated memory is still 196.1MB. Free memory was 152.7MB in the beginning and 149.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 196.1MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.37ms. Allocated memory is still 196.1MB. Free memory was 147.8MB in the beginning and 132.1MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 156412.13ms. Allocated memory was 196.1MB in the beginning and 889.2MB in the end (delta: 693.1MB). Free memory was 131.7MB in the beginning and 664.3MB in the end (delta: -532.6MB). Peak memory consumption was 592.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 123 PlacesBefore, 55 PlacesAfterwards, 125 TransitionsBefore, 54 TransitionsAfterwards, 4636 CoEnabledTransitionPairs, 4 FixpointIterations, 19 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 74 TotalNumberOfCompositions, 13464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4296, positive: 3898, positive conditional: 0, positive unconditional: 3898, negative: 398, negative conditional: 0, negative unconditional: 398, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2115, positive: 2046, positive conditional: 0, positive unconditional: 2046, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4296, positive: 1852, positive conditional: 0, positive unconditional: 1852, negative: 329, negative conditional: 0, negative unconditional: 329, unknown: 2115, unknown conditional: 0, unknown unconditional: 2115] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 20:15:57,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...