/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.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_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:49:05,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:49:05,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:49:05,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:49:05,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:49:05,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:49:05,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:49:05,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:49:05,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:49:05,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:49:05,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:49:05,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:49:05,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:49:05,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:49:05,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:49:05,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:49:05,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:49:05,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:49:05,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:49:05,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:49:05,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:49:05,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:49:05,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:49:05,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:49:05,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:49:05,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:49:05,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:49:05,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:49:05,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:49:05,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:49:05,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:49:05,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:49:05,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:49:05,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:49:05,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:49:05,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:49:05,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:49:05,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:49:05,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:49:05,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:49:05,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:49:05,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 16:49:05,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:49:05,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:49:05,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:49:05,673 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:49:05,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:49:05,674 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:49:05,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:49:05,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:49:05,675 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:49:05,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:49:05,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:49:05,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:49:05,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:49:05,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:49:05,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:49:05,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:49:05,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:49:05,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:49:05,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:49:05,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:49:05,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:49:05,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:49:05,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:49:05,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:49:05,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:49:05,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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-01 16:49:05,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:49:05,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:49:05,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:49:05,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:49:05,932 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:49:05,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-01 16:49:06,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad5e5665/90b4fef4fbf040d89a65c63396dc995f/FLAG374c184cd [2022-03-01 16:49:06,420 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:49:06,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-01 16:49:06,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad5e5665/90b4fef4fbf040d89a65c63396dc995f/FLAG374c184cd [2022-03-01 16:49:06,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad5e5665/90b4fef4fbf040d89a65c63396dc995f [2022-03-01 16:49:06,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:49:06,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:49:06,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:49:06,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:49:06,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:49:06,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:06,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da161ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06, skipping insertion in model container [2022-03-01 16:49:06,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:06,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:49:06,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:49:06,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:49:06,848 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:49:06,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:49:06,931 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:49:06,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06 WrapperNode [2022-03-01 16:49:06,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:49:06,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:49:06,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:49:06,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:49:06,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:06,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:06,987 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-03-01 16:49:06,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:49:06,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:49:06,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:49:06,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:49:06,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:06,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:49:07,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:49:07,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:49:07,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:49:07,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (1/1) ... [2022-03-01 16:49:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:49:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:07,053 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-01 16:49:07,070 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-01 16:49:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:49:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:49:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:49:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:49:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 16:49:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:49:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-01 16:49:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-01 16:49:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:49:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:49:07,087 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:49:07,226 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:49:07,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:49:07,372 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:49:07,378 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:49:07,378 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:49:07,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:49:07 BoogieIcfgContainer [2022-03-01 16:49:07,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:49:07,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:49:07,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:49:07,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:49:07,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:49:06" (1/3) ... [2022-03-01 16:49:07,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6000a64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:49:07, skipping insertion in model container [2022-03-01 16:49:07,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:06" (2/3) ... [2022-03-01 16:49:07,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6000a64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:49:07, skipping insertion in model container [2022-03-01 16:49:07,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:49:07" (3/3) ... [2022-03-01 16:49:07,384 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-03-01 16:49:07,388 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:49:07,388 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:49:07,388 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-01 16:49:07,388 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:49:07,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,414 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-01 16:49:07,414 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-01 16:49:07,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,414 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-01 16:49:07,414 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-01 16:49:07,414 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,415 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,416 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-01 16:49:07,417 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-01 16:49:07,417 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-01 16:49:07,417 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-01 16:49:07,417 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-01 16:49:07,417 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-01 16:49:07,417 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-01 16:49:07,417 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,418 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,419 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-01 16:49:07,420 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-01 16:49:07,420 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-01 16:49:07,420 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-01 16:49:07,420 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-01 16:49:07,420 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-01 16:49:07,420 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-01 16:49:07,420 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-01 16:49:07,421 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-01 16:49:07,421 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-01 16:49:07,421 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-01 16:49:07,421 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-01 16:49:07,421 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-01 16:49:07,422 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-01 16:49:07,422 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-01 16:49:07,422 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-01 16:49:07,422 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-01 16:49:07,422 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-01 16:49:07,422 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-01 16:49:07,422 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,423 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,424 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,425 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,426 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-01 16:49:07,427 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-01 16:49:07,427 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-01 16:49:07,427 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-01 16:49:07,427 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-01 16:49:07,427 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-01 16:49:07,427 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-01 16:49:07,428 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-01 16:49:07,428 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-01 16:49:07,428 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-01 16:49:07,428 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-01 16:49:07,428 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-01 16:49:07,428 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,429 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-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,434 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-01 16:49:07,434 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-01 16:49:07,434 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-01 16:49:07,434 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-01 16:49:07,434 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-01 16:49:07,434 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-01 16:49:07,434 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-01 16:49:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:07,435 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-01 16:49:07,436 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 16:49:07,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:49:07,467 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 16:49:07,467 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-01 16:49:07,473 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 106 transitions, 217 flow [2022-03-01 16:49:07,560 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 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-01 16:49:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 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-01 16:49:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-01 16:49:07,581 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:07,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:07,582 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1089390899, now seen corresponding path program 1 times [2022-03-01 16:49:07,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:07,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011367786] [2022-03-01 16:49:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:07,761 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-01 16:49:07,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:07,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011367786] [2022-03-01 16:49:07,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011367786] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:07,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:07,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:49:07,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190280034] [2022-03-01 16:49:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:07,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 16:49:07,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 16:49:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 16:49:07,795 INFO L87 Difference]: Start difference. First operand has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-01 16:49:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:07,832 INFO L93 Difference]: Finished difference Result 1519 states and 3016 transitions. [2022-03-01 16:49:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 16:49:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-03-01 16:49:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:07,860 INFO L225 Difference]: With dead ends: 1519 [2022-03-01 16:49:07,861 INFO L226 Difference]: Without dead ends: 1519 [2022-03-01 16:49:07,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 16:49:07,865 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:07,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-03-01 16:49:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2022-03-01 16:49:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1511 states have (on average 1.9960291197882196) internal successors, (3016), 1518 states have internal predecessors, (3016), 0 states have call successors, (0), 0 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-01 16:49:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3016 transitions. [2022-03-01 16:49:07,966 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3016 transitions. Word has length 35 [2022-03-01 16:49:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:07,967 INFO L470 AbstractCegarLoop]: Abstraction has 1519 states and 3016 transitions. [2022-03-01 16:49:07,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-01 16:49:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3016 transitions. [2022-03-01 16:49:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-01 16:49:07,969 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:07,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:07,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:49:07,969 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1960811916, now seen corresponding path program 1 times [2022-03-01 16:49:07,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:07,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100209230] [2022-03-01 16:49:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:08,019 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-01 16:49:08,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:08,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100209230] [2022-03-01 16:49:08,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100209230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:08,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:08,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:49:08,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210492143] [2022-03-01 16:49:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:08,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:49:08,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:49:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:49:08,023 INFO L87 Difference]: Start difference. First operand 1519 states and 3016 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-01 16:49:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:08,042 INFO L93 Difference]: Finished difference Result 1523 states and 3020 transitions. [2022-03-01 16:49:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:49:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-03-01 16:49:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:08,047 INFO L225 Difference]: With dead ends: 1523 [2022-03-01 16:49:08,047 INFO L226 Difference]: Without dead ends: 1523 [2022-03-01 16:49:08,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:49:08,048 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:08,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-03-01 16:49:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2022-03-01 16:49:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1512 states have (on average 1.9953703703703705) internal successors, (3017), 1519 states have internal predecessors, (3017), 0 states have call successors, (0), 0 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-01 16:49:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3017 transitions. [2022-03-01 16:49:08,076 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3017 transitions. Word has length 35 [2022-03-01 16:49:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:08,077 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 3017 transitions. [2022-03-01 16:49:08,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-01 16:49:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3017 transitions. [2022-03-01 16:49:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-01 16:49:08,081 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:08,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:08,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:49:08,081 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2113524451, now seen corresponding path program 1 times [2022-03-01 16:49:08,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:08,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147186547] [2022-03-01 16:49:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:08,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:08,179 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-01 16:49:08,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:08,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147186547] [2022-03-01 16:49:08,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147186547] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:08,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052175222] [2022-03-01 16:49:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:08,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:08,188 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-01 16:49:08,189 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-01 16:49:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:08,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:49:08,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:08,377 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-01 16:49:08,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:08,459 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-01 16:49:08,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052175222] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:08,459 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:08,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:49:08,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509586361] [2022-03-01 16:49:08,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:08,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:08,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:49:08,461 INFO L87 Difference]: Start difference. First operand 1520 states and 3017 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-01 16:49:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:08,526 INFO L93 Difference]: Finished difference Result 1530 states and 3027 transitions. [2022-03-01 16:49:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:49:08,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 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-01 16:49:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:08,531 INFO L225 Difference]: With dead ends: 1530 [2022-03-01 16:49:08,532 INFO L226 Difference]: Without dead ends: 1530 [2022-03-01 16:49:08,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-01 16:49:08,533 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:08,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 385 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-03-01 16:49:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-03-01 16:49:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1522 states have (on average 1.9888304862023654) internal successors, (3027), 1529 states have internal predecessors, (3027), 0 states have call successors, (0), 0 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-01 16:49:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3027 transitions. [2022-03-01 16:49:08,566 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3027 transitions. Word has length 40 [2022-03-01 16:49:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:08,567 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 3027 transitions. [2022-03-01 16:49:08,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-01 16:49:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3027 transitions. [2022-03-01 16:49:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:49:08,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:08,569 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:08,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-01 16:49:08,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:08,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 37547901, now seen corresponding path program 2 times [2022-03-01 16:49:08,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:08,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168680025] [2022-03-01 16:49:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:08,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:08,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168680025] [2022-03-01 16:49:08,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168680025] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:08,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17118336] [2022-03-01 16:49:08,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:08,938 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-01 16:49:08,972 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-01 16:49:09,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:09,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:09,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-01 16:49:09,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:09,110 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-01 16:49:09,130 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-01 16:49:09,130 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-01 16:49:09,168 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-01 16:49:09,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, 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-01 16:49:09,225 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 16:49:09,228 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-01 16:49:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-01 16:49:09,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:09,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17118336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:09,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:09,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-01 16:49:09,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960398621] [2022-03-01 16:49:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:09,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:09,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-01 16:49:09,255 INFO L87 Difference]: Start difference. First operand 1530 states and 3027 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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-01 16:49:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:09,411 INFO L93 Difference]: Finished difference Result 1831 states and 3629 transitions. [2022-03-01 16:49:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:09,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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 50 [2022-03-01 16:49:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:09,417 INFO L225 Difference]: With dead ends: 1831 [2022-03-01 16:49:09,417 INFO L226 Difference]: Without dead ends: 1831 [2022-03-01 16:49:09,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-01 16:49:09,418 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 136 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:09,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 498 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:49:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-03-01 16:49:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1679. [2022-03-01 16:49:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1671 states have (on average 1.9898264512268102) internal successors, (3325), 1678 states have internal predecessors, (3325), 0 states have call successors, (0), 0 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-01 16:49:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3325 transitions. [2022-03-01 16:49:09,446 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3325 transitions. Word has length 50 [2022-03-01 16:49:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:09,446 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3325 transitions. [2022-03-01 16:49:09,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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-01 16:49:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3325 transitions. [2022-03-01 16:49:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:49:09,447 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:09,448 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:09,483 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-01 16:49:09,664 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,SelfDestructingSolverStorable3 [2022-03-01 16:49:09,665 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1921653659, now seen corresponding path program 1 times [2022-03-01 16:49:09,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:09,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259884982] [2022-03-01 16:49:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:09,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:09,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259884982] [2022-03-01 16:49:09,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259884982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:09,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928080319] [2022-03-01 16:49:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:09,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:09,743 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-01 16:49:09,757 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-01 16:49:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:09,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 16:49:09,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:09,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:09,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928080319] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:09,996 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:09,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-01 16:49:09,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293796937] [2022-03-01 16:49:09,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:10,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 16:49:10,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:10,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 16:49:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:10,008 INFO L87 Difference]: Start difference. First operand 1679 states and 3325 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-01 16:49:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:10,136 INFO L93 Difference]: Finished difference Result 1699 states and 3345 transitions. [2022-03-01 16:49:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:49:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 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 50 [2022-03-01 16:49:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:10,141 INFO L225 Difference]: With dead ends: 1699 [2022-03-01 16:49:10,142 INFO L226 Difference]: Without dead ends: 1699 [2022-03-01 16:49:10,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-01 16:49:10,143 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:10,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 480 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-03-01 16:49:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2022-03-01 16:49:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1691 states have (on average 1.978119455943229) internal successors, (3345), 1698 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-01 16:49:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3345 transitions. [2022-03-01 16:49:10,170 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3345 transitions. Word has length 50 [2022-03-01 16:49:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:10,170 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 3345 transitions. [2022-03-01 16:49:10,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-01 16:49:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3345 transitions. [2022-03-01 16:49:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-01 16:49:10,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:10,172 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:10,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:10,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:10,396 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:10,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1189660581, now seen corresponding path program 2 times [2022-03-01 16:49:10,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:10,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057693266] [2022-03-01 16:49:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:10,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:10,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057693266] [2022-03-01 16:49:10,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057693266] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:10,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757455354] [2022-03-01 16:49:10,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:10,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:10,584 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-01 16:49:10,611 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-01 16:49:10,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:10,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:10,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-01 16:49:10,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:10,793 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-01 16:49:10,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,815 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-01 16:49:10,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,845 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:10,845 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-01 16:49:10,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:10,881 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:10,881 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-01 16:49:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-01 16:49:10,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:10,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757455354] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:10,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:10,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-01 16:49:10,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393827249] [2022-03-01 16:49:10,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:10,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:10,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:49:10,910 INFO L87 Difference]: Start difference. First operand 1699 states and 3345 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-01 16:49:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:11,316 INFO L93 Difference]: Finished difference Result 3571 states and 7089 transitions. [2022-03-01 16:49:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:11,317 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 70 [2022-03-01 16:49:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:11,328 INFO L225 Difference]: With dead ends: 3571 [2022-03-01 16:49:11,328 INFO L226 Difference]: Without dead ends: 3571 [2022-03-01 16:49:11,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:49:11,329 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 532 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:11,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 1127 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-03-01 16:49:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2167. [2022-03-01 16:49:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2159 states have (on average 1.982862436313108) internal successors, (4281), 2166 states have internal predecessors, (4281), 0 states have call successors, (0), 0 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-01 16:49:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4281 transitions. [2022-03-01 16:49:11,371 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4281 transitions. Word has length 70 [2022-03-01 16:49:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:11,372 INFO L470 AbstractCegarLoop]: Abstraction has 2167 states and 4281 transitions. [2022-03-01 16:49:11,372 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-01 16:49:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4281 transitions. [2022-03-01 16:49:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-01 16:49:11,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:11,373 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:11,407 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-01 16:49:11,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,590 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1998481730, now seen corresponding path program 1 times [2022-03-01 16:49:11,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:11,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983545642] [2022-03-01 16:49:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:11,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:11,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983545642] [2022-03-01 16:49:11,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983545642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:11,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808146821] [2022-03-01 16:49:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:11,755 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-01 16:49:11,756 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-01 16:49:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 16:49:11,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:11,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:12,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808146821] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:12,118 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:12,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-01 16:49:12,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105495566] [2022-03-01 16:49:12,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:12,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:49:12,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:49:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:12,120 INFO L87 Difference]: Start difference. First operand 2167 states and 4281 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-01 16:49:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:12,336 INFO L93 Difference]: Finished difference Result 2182 states and 4296 transitions. [2022-03-01 16:49:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:49:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 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 78 [2022-03-01 16:49:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:12,343 INFO L225 Difference]: With dead ends: 2182 [2022-03-01 16:49:12,343 INFO L226 Difference]: Without dead ends: 2182 [2022-03-01 16:49:12,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:49:12,344 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:12,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 764 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2022-03-01 16:49:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2022-03-01 16:49:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2174 states have (on average 1.9760809567617295) internal successors, (4296), 2181 states have internal predecessors, (4296), 0 states have call successors, (0), 0 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-01 16:49:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 4296 transitions. [2022-03-01 16:49:12,376 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 4296 transitions. Word has length 78 [2022-03-01 16:49:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:12,376 INFO L470 AbstractCegarLoop]: Abstraction has 2182 states and 4296 transitions. [2022-03-01 16:49:12,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-01 16:49:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 4296 transitions. [2022-03-01 16:49:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 16:49:12,377 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:12,377 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:12,410 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-01 16:49:12,610 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-01 16:49:12,611 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 920350873, now seen corresponding path program 2 times [2022-03-01 16:49:12,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:12,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145531791] [2022-03-01 16:49:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:12,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:12,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145531791] [2022-03-01 16:49:12,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145531791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:12,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:12,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:49:12,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339154526] [2022-03-01 16:49:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:12,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:12,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:12,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:12,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:12,733 INFO L87 Difference]: Start difference. First operand 2182 states and 4296 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-01 16:49:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:12,871 INFO L93 Difference]: Finished difference Result 2448 states and 4828 transitions. [2022-03-01 16:49:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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 93 [2022-03-01 16:49:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:12,878 INFO L225 Difference]: With dead ends: 2448 [2022-03-01 16:49:12,879 INFO L226 Difference]: Without dead ends: 2203 [2022-03-01 16:49:12,879 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-01 16:49:12,880 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 141 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:12,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 397 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:49:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-03-01 16:49:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2098. [2022-03-01 16:49:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2090 states have (on average 1.9684210526315788) internal successors, (4114), 2097 states have internal predecessors, (4114), 0 states have call successors, (0), 0 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-01 16:49:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4114 transitions. [2022-03-01 16:49:12,907 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4114 transitions. Word has length 93 [2022-03-01 16:49:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:12,907 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 4114 transitions. [2022-03-01 16:49:12,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-01 16:49:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4114 transitions. [2022-03-01 16:49:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 16:49:12,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:12,912 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:12,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 16:49:12,912 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1018614855, now seen corresponding path program 1 times [2022-03-01 16:49:12,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:12,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272015861] [2022-03-01 16:49:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:12,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:12,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272015861] [2022-03-01 16:49:12,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272015861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:12,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:12,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:49:12,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105692676] [2022-03-01 16:49:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:12,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:12,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:12,999 INFO L87 Difference]: Start difference. First operand 2098 states and 4114 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-01 16:49:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:13,118 INFO L93 Difference]: Finished difference Result 2349 states and 4616 transitions. [2022-03-01 16:49:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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 93 [2022-03-01 16:49:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:13,125 INFO L225 Difference]: With dead ends: 2349 [2022-03-01 16:49:13,125 INFO L226 Difference]: Without dead ends: 2349 [2022-03-01 16:49:13,125 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-01 16:49:13,127 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 125 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:13,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:49:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-03-01 16:49:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2229. [2022-03-01 16:49:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2221 states have (on average 1.970283656010806) internal successors, (4376), 2228 states have internal predecessors, (4376), 0 states have call successors, (0), 0 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-01 16:49:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4376 transitions. [2022-03-01 16:49:13,170 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4376 transitions. Word has length 93 [2022-03-01 16:49:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:13,170 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 4376 transitions. [2022-03-01 16:49:13,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-01 16:49:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4376 transitions. [2022-03-01 16:49:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:13,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:13,172 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:13,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 16:49:13,173 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1317609396, now seen corresponding path program 1 times [2022-03-01 16:49:13,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:13,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628511661] [2022-03-01 16:49:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:13,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:13,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628511661] [2022-03-01 16:49:13,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628511661] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:13,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470272417] [2022-03-01 16:49:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:13,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:13,342 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-01 16:49:13,343 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-01 16:49:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:13,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:13,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:13,610 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-01 16:49:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:13,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:13,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470272417] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:13,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:13,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:13,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323699151] [2022-03-01 16:49:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:13,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:13,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:13,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:13,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:13,673 INFO L87 Difference]: Start difference. First operand 2229 states and 4376 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:14,093 INFO L93 Difference]: Finished difference Result 6535 states and 12955 transitions. [2022-03-01 16:49:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:14,112 INFO L225 Difference]: With dead ends: 6535 [2022-03-01 16:49:14,112 INFO L226 Difference]: Without dead ends: 6535 [2022-03-01 16:49:14,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:14,113 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 663 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:14,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 1290 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-03-01 16:49:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 2407. [2022-03-01 16:49:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2399 states have (on average 1.964568570237599) internal successors, (4713), 2406 states have internal predecessors, (4713), 0 states have call successors, (0), 0 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-01 16:49:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4713 transitions. [2022-03-01 16:49:14,186 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4713 transitions. Word has length 105 [2022-03-01 16:49:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:14,186 INFO L470 AbstractCegarLoop]: Abstraction has 2407 states and 4713 transitions. [2022-03-01 16:49:14,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4713 transitions. [2022-03-01 16:49:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:14,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:14,188 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:14,224 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-01 16:49:14,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:14,406 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1330543596, now seen corresponding path program 2 times [2022-03-01 16:49:14,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:14,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842653258] [2022-03-01 16:49:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:14,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:14,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842653258] [2022-03-01 16:49:14,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842653258] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:14,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076317108] [2022-03-01 16:49:14,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:14,572 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-01 16:49:14,573 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-01 16:49:14,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:14,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:14,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:14,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:14,951 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-01 16:49:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:15,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:15,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076317108] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:15,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:15,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:15,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079803325] [2022-03-01 16:49:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:15,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:15,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:15,019 INFO L87 Difference]: Start difference. First operand 2407 states and 4713 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:15,895 INFO L93 Difference]: Finished difference Result 5977 states and 11801 transitions. [2022-03-01 16:49:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:15,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:15,906 INFO L225 Difference]: With dead ends: 5977 [2022-03-01 16:49:15,907 INFO L226 Difference]: Without dead ends: 5977 [2022-03-01 16:49:15,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:49:15,908 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 1029 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:15,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 1297 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2022-03-01 16:49:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 2486. [2022-03-01 16:49:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2478 states have (on average 1.9580306698950767) internal successors, (4852), 2485 states have internal predecessors, (4852), 0 states have call successors, (0), 0 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-01 16:49:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4852 transitions. [2022-03-01 16:49:15,976 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4852 transitions. Word has length 105 [2022-03-01 16:49:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:15,976 INFO L470 AbstractCegarLoop]: Abstraction has 2486 states and 4852 transitions. [2022-03-01 16:49:15,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4852 transitions. [2022-03-01 16:49:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:15,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:15,978 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:16,007 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-01 16:49:16,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:16,208 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -103262266, now seen corresponding path program 3 times [2022-03-01 16:49:16,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:16,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688068531] [2022-03-01 16:49:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:16,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:16,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688068531] [2022-03-01 16:49:16,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688068531] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:16,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638535590] [2022-03-01 16:49:16,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:16,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:16,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:16,351 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-01 16:49:16,366 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-01 16:49:16,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:16,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:16,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:16,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:16,701 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-01 16:49:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:16,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:16,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638535590] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:16,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:16,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:16,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097395825] [2022-03-01 16:49:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:16,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:16,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:16,803 INFO L87 Difference]: Start difference. First operand 2486 states and 4852 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:17,188 INFO L93 Difference]: Finished difference Result 6280 states and 12407 transitions. [2022-03-01 16:49:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:17,198 INFO L225 Difference]: With dead ends: 6280 [2022-03-01 16:49:17,198 INFO L226 Difference]: Without dead ends: 6280 [2022-03-01 16:49:17,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:49:17,199 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 619 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:17,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 1457 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2022-03-01 16:49:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 2495. [2022-03-01 16:49:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2487 states have (on average 1.9581825492561318) internal successors, (4870), 2494 states have internal predecessors, (4870), 0 states have call successors, (0), 0 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-01 16:49:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4870 transitions. [2022-03-01 16:49:17,242 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4870 transitions. Word has length 105 [2022-03-01 16:49:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:17,242 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4870 transitions. [2022-03-01 16:49:17,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4870 transitions. [2022-03-01 16:49:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:17,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:17,244 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:17,261 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-01 16:49:17,460 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,SelfDestructingSolverStorable11 [2022-03-01 16:49:17,461 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1750076570, now seen corresponding path program 4 times [2022-03-01 16:49:17,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:17,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188659327] [2022-03-01 16:49:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:17,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:17,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188659327] [2022-03-01 16:49:17,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188659327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:17,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670592045] [2022-03-01 16:49:17,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:17,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:17,907 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-01 16:49:17,908 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-01 16:49:18,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:18,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:18,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-01 16:49:18,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:18,328 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-01 16:49:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:18,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:18,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670592045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:18,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:18,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:18,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165203406] [2022-03-01 16:49:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:18,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:18,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:18,400 INFO L87 Difference]: Start difference. First operand 2495 states and 4870 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:19,329 INFO L93 Difference]: Finished difference Result 7583 states and 14975 transitions. [2022-03-01 16:49:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:19,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:19,341 INFO L225 Difference]: With dead ends: 7583 [2022-03-01 16:49:19,342 INFO L226 Difference]: Without dead ends: 7583 [2022-03-01 16:49:19,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2022-03-01 16:49:19,343 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1024 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:19,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 1432 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-03-01 16:49:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 2492. [2022-03-01 16:49:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2484 states have (on average 1.9581320450885669) internal successors, (4864), 2491 states have internal predecessors, (4864), 0 states have call successors, (0), 0 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-01 16:49:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4864 transitions. [2022-03-01 16:49:19,404 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4864 transitions. Word has length 105 [2022-03-01 16:49:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:19,405 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 4864 transitions. [2022-03-01 16:49:19,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4864 transitions. [2022-03-01 16:49:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:19,407 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:19,407 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:19,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-01 16:49:19,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-01 16:49:19,642 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 412316490, now seen corresponding path program 5 times [2022-03-01 16:49:19,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:19,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976241370] [2022-03-01 16:49:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:20,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:20,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976241370] [2022-03-01 16:49:20,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976241370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:20,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598638301] [2022-03-01 16:49:20,013 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:20,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:20,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:20,024 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-01 16:49:20,048 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-01 16:49:20,131 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:20,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:20,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:20,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:20,410 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-01 16:49:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:20,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:20,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598638301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:20,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:20,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:20,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191697128] [2022-03-01 16:49:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:20,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:20,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:20,483 INFO L87 Difference]: Start difference. First operand 2492 states and 4864 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:21,500 INFO L93 Difference]: Finished difference Result 7733 states and 15280 transitions. [2022-03-01 16:49:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 16:49:21,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:21,513 INFO L225 Difference]: With dead ends: 7733 [2022-03-01 16:49:21,513 INFO L226 Difference]: Without dead ends: 7733 [2022-03-01 16:49:21,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=2345, Unknown=0, NotChecked=0, Total=2756 [2022-03-01 16:49:21,515 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1165 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:21,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 1515 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2022-03-01 16:49:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 2496. [2022-03-01 16:49:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2488 states have (on average 1.9581993569131833) internal successors, (4872), 2495 states have internal predecessors, (4872), 0 states have call successors, (0), 0 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-01 16:49:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4872 transitions. [2022-03-01 16:49:21,562 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4872 transitions. Word has length 105 [2022-03-01 16:49:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:21,563 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 4872 transitions. [2022-03-01 16:49:21,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4872 transitions. [2022-03-01 16:49:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:21,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:21,565 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:21,589 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-01 16:49:21,781 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,SelfDestructingSolverStorable13 [2022-03-01 16:49:21,782 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -155675980, now seen corresponding path program 6 times [2022-03-01 16:49:21,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:21,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26092012] [2022-03-01 16:49:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:21,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:21,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26092012] [2022-03-01 16:49:21,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26092012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:21,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9799175] [2022-03-01 16:49:21,922 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:21,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:21,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:21,938 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-01 16:49:21,971 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-01 16:49:22,071 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:22,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:22,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:22,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:22,341 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-01 16:49:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:22,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:22,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9799175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:22,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:22,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:22,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45109894] [2022-03-01 16:49:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:22,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:22,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:22,427 INFO L87 Difference]: Start difference. First operand 2496 states and 4872 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:22,925 INFO L93 Difference]: Finished difference Result 6177 states and 12187 transitions. [2022-03-01 16:49:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:49:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:22,933 INFO L225 Difference]: With dead ends: 6177 [2022-03-01 16:49:22,934 INFO L226 Difference]: Without dead ends: 6177 [2022-03-01 16:49:22,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2022-03-01 16:49:22,934 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 977 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:22,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 1401 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2022-03-01 16:49:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 2536. [2022-03-01 16:49:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2528 states have (on average 1.9588607594936709) internal successors, (4952), 2535 states have internal predecessors, (4952), 0 states have call successors, (0), 0 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-01 16:49:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-03-01 16:49:22,977 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-03-01 16:49:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:22,977 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-03-01 16:49:22,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-03-01 16:49:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:22,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:22,979 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:22,998 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-01 16:49:23,195 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,SelfDestructingSolverStorable14 [2022-03-01 16:49:23,196 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1295126466, now seen corresponding path program 7 times [2022-03-01 16:49:23,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:23,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620549084] [2022-03-01 16:49:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:23,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:23,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620549084] [2022-03-01 16:49:23,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620549084] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:23,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127590223] [2022-03-01 16:49:23,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:23,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:23,329 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-01 16:49:23,330 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-01 16:49:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:23,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:23,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:23,703 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-01 16:49:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:23,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:23,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127590223] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:23,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:23,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:23,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504335069] [2022-03-01 16:49:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:23,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:23,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:23,771 INFO L87 Difference]: Start difference. First operand 2536 states and 4952 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:24,663 INFO L93 Difference]: Finished difference Result 6219 states and 12247 transitions. [2022-03-01 16:49:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:24,670 INFO L225 Difference]: With dead ends: 6219 [2022-03-01 16:49:24,670 INFO L226 Difference]: Without dead ends: 6219 [2022-03-01 16:49:24,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=1226, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:49:24,671 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 928 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:24,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 1487 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2022-03-01 16:49:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 2536. [2022-03-01 16:49:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2528 states have (on average 1.9588607594936709) internal successors, (4952), 2535 states have internal predecessors, (4952), 0 states have call successors, (0), 0 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-01 16:49:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-03-01 16:49:24,714 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-03-01 16:49:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:24,714 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-03-01 16:49:24,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-03-01 16:49:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:24,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:24,716 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:24,742 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-01 16:49:24,933 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,SelfDestructingSolverStorable15 [2022-03-01 16:49:24,933 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2095944408, now seen corresponding path program 8 times [2022-03-01 16:49:24,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:24,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38394914] [2022-03-01 16:49:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:25,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:25,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38394914] [2022-03-01 16:49:25,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38394914] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:25,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359942618] [2022-03-01 16:49:25,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:25,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:25,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:25,181 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-01 16:49:25,182 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-01 16:49:25,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:25,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:25,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:25,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:25,485 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-01 16:49:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:25,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:25,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359942618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:25,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:25,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:25,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449221101] [2022-03-01 16:49:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:25,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:25,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:25,572 INFO L87 Difference]: Start difference. First operand 2536 states and 4952 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:25,928 INFO L93 Difference]: Finished difference Result 5867 states and 11581 transitions. [2022-03-01 16:49:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:25,936 INFO L225 Difference]: With dead ends: 5867 [2022-03-01 16:49:25,936 INFO L226 Difference]: Without dead ends: 5867 [2022-03-01 16:49:25,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-03-01 16:49:25,937 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 611 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:25,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1284 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2022-03-01 16:49:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 2554. [2022-03-01 16:49:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2546 states have (on average 1.9591516103692066) internal successors, (4988), 2553 states have internal predecessors, (4988), 0 states have call successors, (0), 0 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-01 16:49:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-03-01 16:49:25,980 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-03-01 16:49:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:25,980 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-03-01 16:49:25,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-03-01 16:49:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:25,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:25,982 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:25,999 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-01 16:49:26,198 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,SelfDestructingSolverStorable16 [2022-03-01 16:49:26,199 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash 552208584, now seen corresponding path program 9 times [2022-03-01 16:49:26,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:26,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112438926] [2022-03-01 16:49:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:26,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:26,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112438926] [2022-03-01 16:49:26,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112438926] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:26,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499135298] [2022-03-01 16:49:26,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:26,395 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-01 16:49:26,396 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-01 16:49:26,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:26,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:26,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:26,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:26,803 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-01 16:49:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:26,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:26,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499135298] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:26,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:26,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:26,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9154283] [2022-03-01 16:49:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:26,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:26,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:26,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:26,868 INFO L87 Difference]: Start difference. First operand 2554 states and 4988 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:27,660 INFO L93 Difference]: Finished difference Result 7170 states and 14149 transitions. [2022-03-01 16:49:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:49:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:27,669 INFO L225 Difference]: With dead ends: 7170 [2022-03-01 16:49:27,669 INFO L226 Difference]: Without dead ends: 7170 [2022-03-01 16:49:27,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:49:27,670 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 950 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:27,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 1459 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2022-03-01 16:49:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 2551. [2022-03-01 16:49:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2543 states have (on average 1.959103421156115) internal successors, (4982), 2550 states have internal predecessors, (4982), 0 states have call successors, (0), 0 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-01 16:49:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-03-01 16:49:27,714 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-03-01 16:49:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:27,715 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-03-01 16:49:27,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-03-01 16:49:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:27,717 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:27,717 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:27,736 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-01 16:49:27,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:27,934 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1580365652, now seen corresponding path program 10 times [2022-03-01 16:49:27,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:27,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048226519] [2022-03-01 16:49:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:28,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:28,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048226519] [2022-03-01 16:49:28,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048226519] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:28,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611054151] [2022-03-01 16:49:28,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:28,061 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-01 16:49:28,062 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-01 16:49:28,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:28,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:28,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:28,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:28,399 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-01 16:49:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:28,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:28,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611054151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:28,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:28,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-01 16:49:28,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598775202] [2022-03-01 16:49:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:28,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:28,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:49:28,437 INFO L87 Difference]: Start difference. First operand 2551 states and 4982 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-01 16:49:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:29,273 INFO L93 Difference]: Finished difference Result 9974 states and 19724 transitions. [2022-03-01 16:49:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-01 16:49:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-03-01 16:49:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:29,283 INFO L225 Difference]: With dead ends: 9974 [2022-03-01 16:49:29,283 INFO L226 Difference]: Without dead ends: 9974 [2022-03-01 16:49:29,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:49:29,284 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 1228 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:29,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 1516 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:49:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2022-03-01 16:49:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 2555. [2022-03-01 16:49:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2547 states have (on average 1.9591676482135847) internal successors, (4990), 2554 states have internal predecessors, (4990), 0 states have call successors, (0), 0 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-01 16:49:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-03-01 16:49:29,339 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-03-01 16:49:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:29,339 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-03-01 16:49:29,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-01 16:49:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-03-01 16:49:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:29,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:29,341 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:29,371 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-01 16:49:29,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:29,559 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2146609174, now seen corresponding path program 11 times [2022-03-01 16:49:29,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:29,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245851550] [2022-03-01 16:49:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:29,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:29,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245851550] [2022-03-01 16:49:29,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245851550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:29,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472214484] [2022-03-01 16:49:29,839 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:29,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:29,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:29,851 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-01 16:49:29,852 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-01 16:49:29,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:29,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:29,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:29,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:30,243 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-01 16:49:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:30,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:30,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472214484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:30,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:30,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:30,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460908751] [2022-03-01 16:49:30,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:30,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:30,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:30,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:30,339 INFO L87 Difference]: Start difference. First operand 2555 states and 4990 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:30,736 INFO L93 Difference]: Finished difference Result 7437 states and 14669 transitions. [2022-03-01 16:49:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:49:30,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:30,746 INFO L225 Difference]: With dead ends: 7437 [2022-03-01 16:49:30,746 INFO L226 Difference]: Without dead ends: 7437 [2022-03-01 16:49:30,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:49:30,747 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 817 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:30,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 1580 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2022-03-01 16:49:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 2557. [2022-03-01 16:49:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2549 states have (on average 1.959199686151432) internal successors, (4994), 2556 states have internal predecessors, (4994), 0 states have call successors, (0), 0 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-01 16:49:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-03-01 16:49:30,798 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-03-01 16:49:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:30,798 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-03-01 16:49:30,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-03-01 16:49:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:30,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:30,800 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:30,839 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-01 16:49:31,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:31,018 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -697555676, now seen corresponding path program 12 times [2022-03-01 16:49:31,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:31,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634101049] [2022-03-01 16:49:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:31,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:31,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634101049] [2022-03-01 16:49:31,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634101049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:31,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973414300] [2022-03-01 16:49:31,327 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:31,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:31,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:31,328 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-01 16:49:31,374 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-01 16:49:31,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:31,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:31,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:31,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:31,755 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-01 16:49:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:31,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:31,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973414300] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:31,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:31,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:31,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748887790] [2022-03-01 16:49:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:31,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:31,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:31,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:31,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:31,814 INFO L87 Difference]: Start difference. First operand 2557 states and 4994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:32,620 INFO L93 Difference]: Finished difference Result 7479 states and 14729 transitions. [2022-03-01 16:49:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 16:49:32,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:32,629 INFO L225 Difference]: With dead ends: 7479 [2022-03-01 16:49:32,629 INFO L226 Difference]: Without dead ends: 7479 [2022-03-01 16:49:32,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2022-03-01 16:49:32,630 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 901 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:32,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [901 Valid, 1597 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2022-03-01 16:49:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 2545. [2022-03-01 16:49:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2537 states have (on average 1.9590067008277494) internal successors, (4970), 2544 states have internal predecessors, (4970), 0 states have call successors, (0), 0 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-01 16:49:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4970 transitions. [2022-03-01 16:49:32,672 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4970 transitions. Word has length 105 [2022-03-01 16:49:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:32,673 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 4970 transitions. [2022-03-01 16:49:32,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4970 transitions. [2022-03-01 16:49:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:32,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:32,674 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:32,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-01 16:49:32,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:32,891 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 703468234, now seen corresponding path program 13 times [2022-03-01 16:49:32,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:32,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074911141] [2022-03-01 16:49:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:33,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:33,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074911141] [2022-03-01 16:49:33,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074911141] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:33,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771144224] [2022-03-01 16:49:33,262 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:33,264 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-01 16:49:33,291 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-01 16:49:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:33,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:33,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:33,709 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-01 16:49:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:33,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:33,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771144224] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:33,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:33,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:33,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168314524] [2022-03-01 16:49:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:33,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:33,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:33,781 INFO L87 Difference]: Start difference. First operand 2545 states and 4970 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:34,596 INFO L93 Difference]: Finished difference Result 7306 states and 14426 transitions. [2022-03-01 16:49:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:49:34,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:34,605 INFO L225 Difference]: With dead ends: 7306 [2022-03-01 16:49:34,605 INFO L226 Difference]: Without dead ends: 7306 [2022-03-01 16:49:34,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:49:34,606 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1189 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:34,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1363 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-03-01 16:49:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 2555. [2022-03-01 16:49:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2547 states have (on average 1.9591676482135847) internal successors, (4990), 2554 states have internal predecessors, (4990), 0 states have call successors, (0), 0 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-01 16:49:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-03-01 16:49:34,648 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-03-01 16:49:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:34,648 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-03-01 16:49:34,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-03-01 16:49:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:34,650 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:34,650 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:34,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:34,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:34,864 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash 135475764, now seen corresponding path program 14 times [2022-03-01 16:49:34,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:34,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732532797] [2022-03-01 16:49:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:35,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:35,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732532797] [2022-03-01 16:49:35,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732532797] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:35,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882611246] [2022-03-01 16:49:35,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:35,212 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-01 16:49:35,216 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-01 16:49:35,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:35,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:35,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:35,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:35,634 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-01 16:49:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:35,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:35,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882611246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:35,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:35,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:35,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628216921] [2022-03-01 16:49:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:35,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:35,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:35,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:35,755 INFO L87 Difference]: Start difference. First operand 2555 states and 4990 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:36,303 INFO L93 Difference]: Finished difference Result 7627 states and 15035 transitions. [2022-03-01 16:49:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:49:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:36,312 INFO L225 Difference]: With dead ends: 7627 [2022-03-01 16:49:36,312 INFO L226 Difference]: Without dead ends: 7627 [2022-03-01 16:49:36,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:49:36,313 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 865 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:36,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1427 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2022-03-01 16:49:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 2557. [2022-03-01 16:49:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2549 states have (on average 1.959199686151432) internal successors, (4994), 2556 states have internal predecessors, (4994), 0 states have call successors, (0), 0 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-01 16:49:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-03-01 16:49:36,356 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-03-01 16:49:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:36,356 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-03-01 16:49:36,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-03-01 16:49:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:36,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:36,358 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:36,377 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-01 16:49:36,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:36,574 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1586278210, now seen corresponding path program 15 times [2022-03-01 16:49:36,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:36,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270098209] [2022-03-01 16:49:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:36,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:36,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270098209] [2022-03-01 16:49:36,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270098209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:36,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941681559] [2022-03-01 16:49:36,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:36,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:36,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:36,892 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-01 16:49:36,894 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-01 16:49:37,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:37,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:37,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:37,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:37,304 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-01 16:49:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:37,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:37,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941681559] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:37,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:37,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:37,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116777086] [2022-03-01 16:49:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:37,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:37,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:37,376 INFO L87 Difference]: Start difference. First operand 2557 states and 4994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:38,167 INFO L93 Difference]: Finished difference Result 7669 states and 15095 transitions. [2022-03-01 16:49:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:49:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:38,175 INFO L225 Difference]: With dead ends: 7669 [2022-03-01 16:49:38,176 INFO L226 Difference]: Without dead ends: 7669 [2022-03-01 16:49:38,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:49:38,177 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 986 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:38,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 1501 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-03-01 16:49:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 2551. [2022-03-01 16:49:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2543 states have (on average 1.959103421156115) internal successors, (4982), 2550 states have internal predecessors, (4982), 0 states have call successors, (0), 0 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-01 16:49:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-03-01 16:49:38,217 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-03-01 16:49:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:38,217 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-03-01 16:49:38,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-03-01 16:49:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:38,219 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:38,219 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:38,236 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-01 16:49:38,431 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,SelfDestructingSolverStorable23 [2022-03-01 16:49:38,431 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -27754878, now seen corresponding path program 16 times [2022-03-01 16:49:38,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:38,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953076351] [2022-03-01 16:49:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:38,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:38,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953076351] [2022-03-01 16:49:38,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953076351] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:38,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317728596] [2022-03-01 16:49:38,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:38,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:38,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:38,533 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-01 16:49:38,547 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-01 16:49:38,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:38,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:38,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 16:49:38,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:38,945 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-01 16:49:39,064 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-01 16:49:39,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,095 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-01 16:49:39,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,134 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-01 16:49:39,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:39,187 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-01 16:49:39,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:49:39,233 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 19 treesize of output 7 [2022-03-01 16:49:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:39,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:39,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317728596] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:39,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:39,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2022-03-01 16:49:39,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848486632] [2022-03-01 16:49:39,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:39,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:49:39,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:49:39,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:49:39,248 INFO L87 Difference]: Start difference. First operand 2551 states and 4982 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-01 16:49:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:39,893 INFO L93 Difference]: Finished difference Result 6873 states and 13572 transitions. [2022-03-01 16:49:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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 105 [2022-03-01 16:49:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:39,901 INFO L225 Difference]: With dead ends: 6873 [2022-03-01 16:49:39,901 INFO L226 Difference]: Without dead ends: 6873 [2022-03-01 16:49:39,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=922, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:49:39,902 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 744 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:39,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 1284 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2022-03-01 16:49:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 2556. [2022-03-01 16:49:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2548 states have (on average 1.9591836734693877) internal successors, (4992), 2555 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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-01 16:49:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4992 transitions. [2022-03-01 16:49:39,976 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4992 transitions. Word has length 105 [2022-03-01 16:49:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:39,977 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 4992 transitions. [2022-03-01 16:49:39,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-01 16:49:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4992 transitions. [2022-03-01 16:49:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:39,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:39,978 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:39,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-01 16:49:40,195 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,SelfDestructingSolverStorable24 [2022-03-01 16:49:40,195 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 782515202, now seen corresponding path program 17 times [2022-03-01 16:49:40,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:40,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194615569] [2022-03-01 16:49:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:40,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:40,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194615569] [2022-03-01 16:49:40,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194615569] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:40,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551079217] [2022-03-01 16:49:40,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:40,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:40,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:40,375 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-01 16:49:40,406 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-01 16:49:40,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:40,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:40,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:40,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:40,698 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-01 16:49:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:40,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:40,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551079217] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:40,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:40,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:40,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219274691] [2022-03-01 16:49:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:40,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:40,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:40,742 INFO L87 Difference]: Start difference. First operand 2556 states and 4992 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:41,450 INFO L93 Difference]: Finished difference Result 7089 states and 13973 transitions. [2022-03-01 16:49:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 16:49:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:41,458 INFO L225 Difference]: With dead ends: 7089 [2022-03-01 16:49:41,458 INFO L226 Difference]: Without dead ends: 7089 [2022-03-01 16:49:41,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:49:41,459 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 1073 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:41,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1073 Valid, 1406 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-03-01 16:49:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2554. [2022-03-01 16:49:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2546 states have (on average 1.9591516103692066) internal successors, (4988), 2553 states have internal predecessors, (4988), 0 states have call successors, (0), 0 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-01 16:49:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-03-01 16:49:41,499 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-03-01 16:49:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:41,499 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-03-01 16:49:41,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-03-01 16:49:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:41,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:41,500 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:41,518 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-01 16:49:41,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-01 16:49:41,717 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -612674444, now seen corresponding path program 18 times [2022-03-01 16:49:41,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:41,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989079078] [2022-03-01 16:49:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:42,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:42,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989079078] [2022-03-01 16:49:42,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989079078] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:42,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978327076] [2022-03-01 16:49:42,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:42,012 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-01 16:49:42,013 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-01 16:49:42,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:42,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:42,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:42,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:42,427 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-01 16:49:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:42,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:42,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978327076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:42,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:42,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:42,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538565227] [2022-03-01 16:49:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:42,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:42,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:42,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:42,544 INFO L87 Difference]: Start difference. First operand 2554 states and 4988 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:42,840 INFO L93 Difference]: Finished difference Result 4622 states and 9091 transitions. [2022-03-01 16:49:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:42,845 INFO L225 Difference]: With dead ends: 4622 [2022-03-01 16:49:42,845 INFO L226 Difference]: Without dead ends: 4622 [2022-03-01 16:49:42,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2022-03-01 16:49:42,846 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 458 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:42,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 1027 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-03-01 16:49:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2611. [2022-03-01 16:49:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2603 states have (on average 1.9600461006530925) internal successors, (5102), 2610 states have internal predecessors, (5102), 0 states have call successors, (0), 0 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-01 16:49:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 5102 transitions. [2022-03-01 16:49:42,879 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 5102 transitions. Word has length 105 [2022-03-01 16:49:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:42,880 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 5102 transitions. [2022-03-01 16:49:42,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 5102 transitions. [2022-03-01 16:49:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:42,881 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:42,881 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:42,898 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-01 16:49:43,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:43,099 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -830929600, now seen corresponding path program 19 times [2022-03-01 16:49:43,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:43,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003253461] [2022-03-01 16:49:43,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:43,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:43,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003253461] [2022-03-01 16:49:43,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003253461] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:43,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972739187] [2022-03-01 16:49:43,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:43,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:43,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:43,209 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-01 16:49:43,210 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-01 16:49:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:43,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:43,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:43,521 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-01 16:49:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:43,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:43,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972739187] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:43,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:43,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:43,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037470712] [2022-03-01 16:49:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:43,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:43,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:43,575 INFO L87 Difference]: Start difference. First operand 2611 states and 5102 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:43,806 INFO L93 Difference]: Finished difference Result 5142 states and 10145 transitions. [2022-03-01 16:49:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:43,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:43,811 INFO L225 Difference]: With dead ends: 5142 [2022-03-01 16:49:43,812 INFO L226 Difference]: Without dead ends: 5142 [2022-03-01 16:49:43,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:49:43,812 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 559 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:43,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 1280 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-03-01 16:49:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 2626. [2022-03-01 16:49:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2618 states have (on average 1.9602750190985485) internal successors, (5132), 2625 states have internal predecessors, (5132), 0 states have call successors, (0), 0 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-01 16:49:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-03-01 16:49:43,843 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-03-01 16:49:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:43,843 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-03-01 16:49:43,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-03-01 16:49:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:43,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:43,844 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:43,861 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-01 16:49:44,061 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,SelfDestructingSolverStorable27 [2022-03-01 16:49:44,061 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1817223392, now seen corresponding path program 20 times [2022-03-01 16:49:44,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:44,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129322867] [2022-03-01 16:49:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:44,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:44,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129322867] [2022-03-01 16:49:44,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129322867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:44,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488462483] [2022-03-01 16:49:44,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:44,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:44,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:44,363 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-01 16:49:44,364 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-01 16:49:44,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:44,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:44,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:44,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:44,734 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-01 16:49:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:44,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:44,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488462483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:44,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:44,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:44,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469724578] [2022-03-01 16:49:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:44,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:44,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:44,785 INFO L87 Difference]: Start difference. First operand 2626 states and 5132 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:45,333 INFO L93 Difference]: Finished difference Result 6445 states and 12713 transitions. [2022-03-01 16:49:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:45,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:45,341 INFO L225 Difference]: With dead ends: 6445 [2022-03-01 16:49:45,341 INFO L226 Difference]: Without dead ends: 6445 [2022-03-01 16:49:45,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:49:45,342 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 959 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:45,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 1302 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-03-01 16:49:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 2623. [2022-03-01 16:49:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2615 states have (on average 1.9602294455066922) internal successors, (5126), 2622 states have internal predecessors, (5126), 0 states have call successors, (0), 0 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-01 16:49:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-03-01 16:49:45,379 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-03-01 16:49:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:45,379 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-03-01 16:49:45,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-03-01 16:49:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:45,380 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:45,380 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:45,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:45,597 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,SelfDestructingSolverStorable28 [2022-03-01 16:49:45,598 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:45,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -315350844, now seen corresponding path program 21 times [2022-03-01 16:49:45,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:45,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50767158] [2022-03-01 16:49:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:45,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:45,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50767158] [2022-03-01 16:49:45,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50767158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:45,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099142145] [2022-03-01 16:49:45,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:45,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:45,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:45,870 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-01 16:49:45,887 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-01 16:49:46,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:46,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:46,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:46,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:46,339 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-01 16:49:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:46,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:46,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099142145] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:46,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:46,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:46,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883227738] [2022-03-01 16:49:46,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:46,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:46,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:46,387 INFO L87 Difference]: Start difference. First operand 2623 states and 5126 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:47,057 INFO L93 Difference]: Finished difference Result 8268 states and 16326 transitions. [2022-03-01 16:49:47,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:47,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:47,067 INFO L225 Difference]: With dead ends: 8268 [2022-03-01 16:49:47,067 INFO L226 Difference]: Without dead ends: 8268 [2022-03-01 16:49:47,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=2011, Unknown=0, NotChecked=0, Total=2352 [2022-03-01 16:49:47,069 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 1119 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:47,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1119 Valid, 1704 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2022-03-01 16:49:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 2627. [2022-03-01 16:49:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2619 states have (on average 1.9602901870943108) internal successors, (5134), 2626 states have internal predecessors, (5134), 0 states have call successors, (0), 0 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-01 16:49:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-03-01 16:49:47,114 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-03-01 16:49:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:47,115 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-03-01 16:49:47,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-03-01 16:49:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:47,116 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:47,116 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:47,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-01 16:49:47,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:47,327 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash -883343314, now seen corresponding path program 22 times [2022-03-01 16:49:47,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:47,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000652846] [2022-03-01 16:49:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:47,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:47,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:47,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000652846] [2022-03-01 16:49:47,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000652846] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:47,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628171081] [2022-03-01 16:49:47,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:47,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:47,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:47,708 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-01 16:49:47,728 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-01 16:49:47,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:47,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:47,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:47,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:48,125 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-01 16:49:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:48,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:48,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628171081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:48,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:48,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-03-01 16:49:48,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973911929] [2022-03-01 16:49:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:48,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:48,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:48,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:49:48,182 INFO L87 Difference]: Start difference. First operand 2627 states and 5134 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-01 16:49:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:48,861 INFO L93 Difference]: Finished difference Result 7769 states and 15347 transitions. [2022-03-01 16:49:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:49:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-03-01 16:49:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:48,872 INFO L225 Difference]: With dead ends: 7769 [2022-03-01 16:49:48,872 INFO L226 Difference]: Without dead ends: 7769 [2022-03-01 16:49:48,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:49:48,874 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 991 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:48,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [991 Valid, 1449 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7769 states. [2022-03-01 16:49:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7769 to 2629. [2022-03-01 16:49:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2621 states have (on average 1.9603204883632201) internal successors, (5138), 2628 states have internal predecessors, (5138), 0 states have call successors, (0), 0 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-01 16:49:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-03-01 16:49:48,946 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-03-01 16:49:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:48,951 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-03-01 16:49:48,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-01 16:49:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-03-01 16:49:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:48,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:48,953 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:48,970 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-01 16:49:49,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:49,168 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash 567459132, now seen corresponding path program 23 times [2022-03-01 16:49:49,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:49,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603388836] [2022-03-01 16:49:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:49,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:49,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603388836] [2022-03-01 16:49:49,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603388836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:49,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990838742] [2022-03-01 16:49:49,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:49,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:49,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:49,428 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-01 16:49:49,429 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-01 16:49:49,605 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:49,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:49,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:49,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:49,848 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-01 16:49:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:49,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:49,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990838742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:49,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:49,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:49,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409943964] [2022-03-01 16:49:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:49,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:49,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:49,906 INFO L87 Difference]: Start difference. First operand 2629 states and 5138 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:50,670 INFO L93 Difference]: Finished difference Result 6754 states and 13293 transitions. [2022-03-01 16:49:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:50,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:50,677 INFO L225 Difference]: With dead ends: 6754 [2022-03-01 16:49:50,678 INFO L226 Difference]: Without dead ends: 6754 [2022-03-01 16:49:50,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:49:50,680 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 881 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:50,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 1694 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2022-03-01 16:49:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 2617. [2022-03-01 16:49:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2609 states have (on average 1.9601379839018782) internal successors, (5114), 2616 states have internal predecessors, (5114), 0 states have call successors, (0), 0 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-01 16:49:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-03-01 16:49:50,718 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-03-01 16:49:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:50,718 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-03-01 16:49:50,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-03-01 16:49:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:50,720 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:50,720 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:50,737 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-01 16:49:50,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:50,937 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1968483042, now seen corresponding path program 24 times [2022-03-01 16:49:50,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:50,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510644000] [2022-03-01 16:49:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:51,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:51,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510644000] [2022-03-01 16:49:51,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510644000] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:51,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912025789] [2022-03-01 16:49:51,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:51,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:51,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:51,188 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-01 16:49:51,189 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-01 16:49:51,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:51,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:51,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:51,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:51,547 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-01 16:49:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:51,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:51,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912025789] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:51,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:51,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:51,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911797746] [2022-03-01 16:49:51,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:51,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:51,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:51,611 INFO L87 Difference]: Start difference. First operand 2617 states and 5114 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:52,342 INFO L93 Difference]: Finished difference Result 7944 states and 15678 transitions. [2022-03-01 16:49:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:49:52,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:52,351 INFO L225 Difference]: With dead ends: 7944 [2022-03-01 16:49:52,351 INFO L226 Difference]: Without dead ends: 7944 [2022-03-01 16:49:52,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:49:52,353 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 1151 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:52,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 1638 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-03-01 16:49:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 2627. [2022-03-01 16:49:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2619 states have (on average 1.9602901870943108) internal successors, (5134), 2626 states have internal predecessors, (5134), 0 states have call successors, (0), 0 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-01 16:49:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-03-01 16:49:52,397 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-03-01 16:49:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:52,397 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-03-01 16:49:52,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-03-01 16:49:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:52,399 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:52,399 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:52,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:52,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:52,616 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1400490572, now seen corresponding path program 25 times [2022-03-01 16:49:52,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:52,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216714609] [2022-03-01 16:49:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:52,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:52,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216714609] [2022-03-01 16:49:52,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216714609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:52,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568670007] [2022-03-01 16:49:52,771 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:52,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:52,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:52,796 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-01 16:49:52,796 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-01 16:49:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:52,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:52,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:53,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 13 treesize of output 9 [2022-03-01 16:49:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:53,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:53,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568670007] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:53,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:53,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:53,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548511813] [2022-03-01 16:49:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:53,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:53,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:53,298 INFO L87 Difference]: Start difference. First operand 2627 states and 5134 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:53,812 INFO L93 Difference]: Finished difference Result 8265 states and 16287 transitions. [2022-03-01 16:49:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:49:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:53,822 INFO L225 Difference]: With dead ends: 8265 [2022-03-01 16:49:53,822 INFO L226 Difference]: Without dead ends: 8265 [2022-03-01 16:49:53,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-03-01 16:49:53,823 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 886 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:53,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 1651 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2022-03-01 16:49:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 2629. [2022-03-01 16:49:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2621 states have (on average 1.9603204883632201) internal successors, (5138), 2628 states have internal predecessors, (5138), 0 states have call successors, (0), 0 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-01 16:49:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-03-01 16:49:53,877 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-03-01 16:49:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:53,877 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-03-01 16:49:53,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-03-01 16:49:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:53,879 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:53,879 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:53,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:54,096 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,SelfDestructingSolverStorable33 [2022-03-01 16:49:54,096 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:54,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1443674278, now seen corresponding path program 26 times [2022-03-01 16:49:54,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:54,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240104068] [2022-03-01 16:49:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:54,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:54,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240104068] [2022-03-01 16:49:54,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240104068] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:54,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039547561] [2022-03-01 16:49:54,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:54,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:54,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:54,259 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-01 16:49:54,308 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-01 16:49:54,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:54,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:54,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:54,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:54,690 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-01 16:49:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:54,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:54,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039547561] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:54,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:54,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:54,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665605175] [2022-03-01 16:49:54,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:54,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:54,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:54,748 INFO L87 Difference]: Start difference. First operand 2629 states and 5138 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:55,446 INFO L93 Difference]: Finished difference Result 8307 states and 16347 transitions. [2022-03-01 16:49:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:55,456 INFO L225 Difference]: With dead ends: 8307 [2022-03-01 16:49:55,457 INFO L226 Difference]: Without dead ends: 8307 [2022-03-01 16:49:55,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:55,458 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 954 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:55,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 1698 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2022-03-01 16:49:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 2623. [2022-03-01 16:49:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2615 states have (on average 1.9602294455066922) internal successors, (5126), 2622 states have internal predecessors, (5126), 0 states have call successors, (0), 0 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-01 16:49:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-03-01 16:49:55,506 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-03-01 16:49:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:55,506 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-03-01 16:49:55,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-03-01 16:49:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:55,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:55,508 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:55,526 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-01 16:49:55,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:55,711 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1237259930, now seen corresponding path program 27 times [2022-03-01 16:49:55,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:55,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94216171] [2022-03-01 16:49:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:55,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:55,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94216171] [2022-03-01 16:49:55,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94216171] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:55,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404572772] [2022-03-01 16:49:55,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:55,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:55,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:55,819 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-01 16:49:55,820 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-01 16:49:55,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:55,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:55,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:55,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:56,207 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-01 16:49:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:56,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:56,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404572772] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:56,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:56,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:56,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259976649] [2022-03-01 16:49:56,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:56,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:56,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:56,292 INFO L87 Difference]: Start difference. First operand 2623 states and 5126 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:56,671 INFO L93 Difference]: Finished difference Result 7504 states and 14817 transitions. [2022-03-01 16:49:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:49:56,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:49:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:56,681 INFO L225 Difference]: With dead ends: 7504 [2022-03-01 16:49:56,681 INFO L226 Difference]: Without dead ends: 7504 [2022-03-01 16:49:56,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-03-01 16:49:56,682 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 748 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:56,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 1535 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2022-03-01 16:49:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 2628. [2022-03-01 16:49:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2620 states have (on average 1.9603053435114504) internal successors, (5136), 2627 states have internal predecessors, (5136), 0 states have call successors, (0), 0 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-01 16:49:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 5136 transitions. [2022-03-01 16:49:56,726 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 5136 transitions. Word has length 105 [2022-03-01 16:49:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:56,726 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 5136 transitions. [2022-03-01 16:49:56,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:49:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 5136 transitions. [2022-03-01 16:49:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:56,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:56,727 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:56,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:56,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:56,944 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:49:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2047530010, now seen corresponding path program 28 times [2022-03-01 16:49:56,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:56,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482856131] [2022-03-01 16:49:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:57,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:57,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482856131] [2022-03-01 16:49:57,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482856131] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:57,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285216963] [2022-03-01 16:49:57,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:57,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:57,113 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-01 16:49:57,114 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-01 16:49:57,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:57,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:57,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-01 16:49:57,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:57,557 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-01 16:49:57,652 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-01 16:49:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,678 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-01 16:49:57,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,708 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-01 16:49:57,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,753 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-01 16:49:57,792 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:49:57,792 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-01 16:49:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:57,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:57,891 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 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-01 16:49:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:57,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:57,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285216963] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:57,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:57,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-03-01 16:49:57,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136282191] [2022-03-01 16:49:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:57,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:49:57,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:57,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:49:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:49:57,923 INFO L87 Difference]: Start difference. First operand 2628 states and 5136 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-01 16:49:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:59,887 INFO L93 Difference]: Finished difference Result 7649 states and 15107 transitions. [2022-03-01 16:49:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-01 16:49:59,887 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 105 [2022-03-01 16:49:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:59,898 INFO L225 Difference]: With dead ends: 7649 [2022-03-01 16:49:59,898 INFO L226 Difference]: Without dead ends: 7649 [2022-03-01 16:49:59,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=556, Invalid=2200, Unknown=0, NotChecked=0, Total=2756 [2022-03-01 16:49:59,899 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 966 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:59,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 2044 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:49:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2022-03-01 16:49:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 2648. [2022-03-01 16:49:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2640 states have (on average 1.9606060606060607) internal successors, (5176), 2647 states have internal predecessors, (5176), 0 states have call successors, (0), 0 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-01 16:49:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 5176 transitions. [2022-03-01 16:49:59,944 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 5176 transitions. Word has length 105 [2022-03-01 16:49:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:59,945 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 5176 transitions. [2022-03-01 16:49:59,945 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-01 16:49:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 5176 transitions. [2022-03-01 16:49:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:59,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:59,946 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:59,963 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-01 16:50:00,163 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,SelfDestructingSolverStorable36 [2022-03-01 16:50:00,163 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1665619056, now seen corresponding path program 29 times [2022-03-01 16:50:00,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:00,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602607077] [2022-03-01 16:50:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:00,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:00,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602607077] [2022-03-01 16:50:00,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602607077] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:00,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301315757] [2022-03-01 16:50:00,442 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:00,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:00,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:00,444 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-01 16:50:00,445 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-01 16:50:00,649 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:00,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:00,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:00,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:00,897 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-01 16:50:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:00,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:00,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301315757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:00,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:00,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:50:00,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090592353] [2022-03-01 16:50:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:00,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:00,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:00,950 INFO L87 Difference]: Start difference. First operand 2648 states and 5176 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:01,803 INFO L93 Difference]: Finished difference Result 7727 states and 15225 transitions. [2022-03-01 16:50:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:50:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:01,814 INFO L225 Difference]: With dead ends: 7727 [2022-03-01 16:50:01,814 INFO L226 Difference]: Without dead ends: 7727 [2022-03-01 16:50:01,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:50:01,816 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1070 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:01,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 1538 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2022-03-01 16:50:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 2626. [2022-03-01 16:50:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2618 states have (on average 1.9602750190985485) internal successors, (5132), 2625 states have internal predecessors, (5132), 0 states have call successors, (0), 0 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-01 16:50:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-03-01 16:50:01,861 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-03-01 16:50:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:01,861 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-03-01 16:50:01,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-03-01 16:50:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:01,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:01,863 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:01,882 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-01 16:50:02,079 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,SelfDestructingSolverStorable37 [2022-03-01 16:50:02,080 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 652340364, now seen corresponding path program 30 times [2022-03-01 16:50:02,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:02,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347164653] [2022-03-01 16:50:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:02,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:02,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347164653] [2022-03-01 16:50:02,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347164653] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:02,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119355] [2022-03-01 16:50:02,352 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:02,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:02,364 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-01 16:50:02,407 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-01 16:50:02,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:02,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:02,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:02,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:02,823 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-01 16:50:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:02,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:02,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119355] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:02,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:02,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:50:02,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717521945] [2022-03-01 16:50:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:02,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:02,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:02,941 INFO L87 Difference]: Start difference. First operand 2626 states and 5132 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:03,287 INFO L93 Difference]: Finished difference Result 5260 states and 10343 transitions. [2022-03-01 16:50:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:50:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:03,293 INFO L225 Difference]: With dead ends: 5260 [2022-03-01 16:50:03,293 INFO L226 Difference]: Without dead ends: 5260 [2022-03-01 16:50:03,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2022-03-01 16:50:03,293 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 452 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:03,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 1387 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2022-03-01 16:50:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 2608. [2022-03-01 16:50:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2600 states have (on average 1.96) internal successors, (5096), 2607 states have internal predecessors, (5096), 0 states have call successors, (0), 0 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-01 16:50:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-03-01 16:50:03,324 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-03-01 16:50:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:03,324 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-03-01 16:50:03,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-03-01 16:50:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:03,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:03,325 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:03,344 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-01 16:50:03,531 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,SelfDestructingSolverStorable38 [2022-03-01 16:50:03,531 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 564648876, now seen corresponding path program 31 times [2022-03-01 16:50:03,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:03,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181563893] [2022-03-01 16:50:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:03,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:03,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181563893] [2022-03-01 16:50:03,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181563893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:03,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248875139] [2022-03-01 16:50:03,847 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:03,848 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-01 16:50:03,849 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-01 16:50:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:04,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:04,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:04,314 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-01 16:50:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:04,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:04,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248875139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:04,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:04,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:50:04,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938717258] [2022-03-01 16:50:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:04,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:04,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:04,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:04,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:04,385 INFO L87 Difference]: Start difference. First operand 2608 states and 5096 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:05,077 INFO L93 Difference]: Finished difference Result 6726 states and 13266 transitions. [2022-03-01 16:50:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:05,084 INFO L225 Difference]: With dead ends: 6726 [2022-03-01 16:50:05,084 INFO L226 Difference]: Without dead ends: 6726 [2022-03-01 16:50:05,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=381, Invalid=2169, Unknown=0, NotChecked=0, Total=2550 [2022-03-01 16:50:05,085 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1246 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:05,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1594 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2022-03-01 16:50:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 2616. [2022-03-01 16:50:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2608 states have (on average 1.960122699386503) internal successors, (5112), 2615 states have internal predecessors, (5112), 0 states have call successors, (0), 0 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-01 16:50:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 5112 transitions. [2022-03-01 16:50:05,122 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 5112 transitions. Word has length 105 [2022-03-01 16:50:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:05,123 INFO L470 AbstractCegarLoop]: Abstraction has 2616 states and 5112 transitions. [2022-03-01 16:50:05,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 5112 transitions. [2022-03-01 16:50:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:05,124 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:05,124 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:05,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:05,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-01 16:50:05,338 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -3343594, now seen corresponding path program 32 times [2022-03-01 16:50:05,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:05,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480455348] [2022-03-01 16:50:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:05,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:05,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480455348] [2022-03-01 16:50:05,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480455348] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:05,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863063828] [2022-03-01 16:50:05,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:05,490 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-01 16:50:05,491 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-01 16:50:05,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:05,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:05,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:05,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:05,896 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-01 16:50:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:05,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:05,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863063828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:05,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:05,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:05,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739732872] [2022-03-01 16:50:05,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:05,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:05,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:05,974 INFO L87 Difference]: Start difference. First operand 2616 states and 5112 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:06,577 INFO L93 Difference]: Finished difference Result 7047 states and 13875 transitions. [2022-03-01 16:50:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:50:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:06,585 INFO L225 Difference]: With dead ends: 7047 [2022-03-01 16:50:06,585 INFO L226 Difference]: Without dead ends: 7047 [2022-03-01 16:50:06,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:50:06,585 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 940 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:06,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 1574 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2022-03-01 16:50:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 2618. [2022-03-01 16:50:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2610 states have (on average 1.9601532567049809) internal successors, (5116), 2617 states have internal predecessors, (5116), 0 states have call successors, (0), 0 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-01 16:50:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 5116 transitions. [2022-03-01 16:50:06,622 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 5116 transitions. Word has length 105 [2022-03-01 16:50:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:06,623 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 5116 transitions. [2022-03-01 16:50:06,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 5116 transitions. [2022-03-01 16:50:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:06,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:06,624 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:06,641 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-01 16:50:06,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:06,841 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1447458852, now seen corresponding path program 33 times [2022-03-01 16:50:06,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:06,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62502660] [2022-03-01 16:50:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:07,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62502660] [2022-03-01 16:50:07,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62502660] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:07,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376342938] [2022-03-01 16:50:07,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:07,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:07,108 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-01 16:50:07,109 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-01 16:50:07,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:07,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:07,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:07,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:07,578 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-01 16:50:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:07,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:07,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376342938] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:07,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:50:07,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997446306] [2022-03-01 16:50:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:07,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:07,646 INFO L87 Difference]: Start difference. First operand 2618 states and 5116 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:08,622 INFO L93 Difference]: Finished difference Result 7089 states and 13935 transitions. [2022-03-01 16:50:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:08,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:08,630 INFO L225 Difference]: With dead ends: 7089 [2022-03-01 16:50:08,630 INFO L226 Difference]: Without dead ends: 7089 [2022-03-01 16:50:08,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2022-03-01 16:50:08,631 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 1032 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:08,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 1643 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-03-01 16:50:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2612. [2022-03-01 16:50:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2604 states have (on average 1.9600614439324118) internal successors, (5104), 2611 states have internal predecessors, (5104), 0 states have call successors, (0), 0 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-01 16:50:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 5104 transitions. [2022-03-01 16:50:08,665 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 5104 transitions. Word has length 105 [2022-03-01 16:50:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,665 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 5104 transitions. [2022-03-01 16:50:08,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 5104 transitions. [2022-03-01 16:50:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:08,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,667 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:08,686 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-01 16:50:08,883 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,SelfDestructingSolverStorable41 [2022-03-01 16:50:08,884 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash -166574236, now seen corresponding path program 34 times [2022-03-01 16:50:08,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:08,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055296389] [2022-03-01 16:50:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:09,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:09,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055296389] [2022-03-01 16:50:09,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055296389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:09,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054105406] [2022-03-01 16:50:09,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:50:09,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:09,167 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-01 16:50:09,168 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-01 16:50:09,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:50:09,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:09,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-01 16:50:09,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:09,654 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-01 16:50:09,798 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-01 16:50:09,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,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-01 16:50:09,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,885 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-01 16:50:09,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:09,935 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-01 16:50:09,987 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:50:09,987 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-01 16:50:10,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:10,079 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:50:10,079 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 6 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:50:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:10,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:10,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054105406] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:10,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:10,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2022-03-01 16:50:10,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537313100] [2022-03-01 16:50:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:10,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 16:50:10,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 16:50:10,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-03-01 16:50:10,135 INFO L87 Difference]: Start difference. First operand 2612 states and 5104 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-01 16:50:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:11,744 INFO L93 Difference]: Finished difference Result 8798 states and 17396 transitions. [2022-03-01 16:50:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:11,744 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 105 [2022-03-01 16:50:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:11,755 INFO L225 Difference]: With dead ends: 8798 [2022-03-01 16:50:11,755 INFO L226 Difference]: Without dead ends: 8798 [2022-03-01 16:50:11,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=475, Invalid=2605, Unknown=0, NotChecked=0, Total=3080 [2022-03-01 16:50:11,756 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 1053 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:11,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 2125 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:50:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2022-03-01 16:50:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 2658. [2022-03-01 16:50:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2650 states have (on average 1.9607547169811321) internal successors, (5196), 2657 states have internal predecessors, (5196), 0 states have call successors, (0), 0 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-01 16:50:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 5196 transitions. [2022-03-01 16:50:11,826 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 5196 transitions. Word has length 105 [2022-03-01 16:50:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:11,826 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 5196 transitions. [2022-03-01 16:50:11,827 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-01 16:50:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 5196 transitions. [2022-03-01 16:50:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:11,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:11,828 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:11,845 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-01 16:50:12,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-01 16:50:12,045 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 415243994, now seen corresponding path program 35 times [2022-03-01 16:50:12,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:12,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058925415] [2022-03-01 16:50:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:12,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:12,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058925415] [2022-03-01 16:50:12,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058925415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:12,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92760543] [2022-03-01 16:50:12,318 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:12,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:12,319 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-01 16:50:12,320 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-01 16:50:12,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:12,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:12,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:12,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:12,794 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-01 16:50:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:12,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:12,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92760543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:12,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:12,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:50:12,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610810550] [2022-03-01 16:50:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:12,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:12,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:12,885 INFO L87 Difference]: Start difference. First operand 2658 states and 5196 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:13,472 INFO L93 Difference]: Finished difference Result 7844 states and 15465 transitions. [2022-03-01 16:50:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:50:13,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:13,481 INFO L225 Difference]: With dead ends: 7844 [2022-03-01 16:50:13,482 INFO L226 Difference]: Without dead ends: 7844 [2022-03-01 16:50:13,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:50:13,482 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 840 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:13,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 1569 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-03-01 16:50:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 2617. [2022-03-01 16:50:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2609 states have (on average 1.9601379839018782) internal successors, (5114), 2616 states have internal predecessors, (5114), 0 states have call successors, (0), 0 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-01 16:50:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-03-01 16:50:13,527 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-03-01 16:50:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:13,528 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-03-01 16:50:13,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-03-01 16:50:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:13,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:13,529 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:13,549 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-01 16:50:13,747 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,SelfDestructingSolverStorable43 [2022-03-01 16:50:13,747 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 643695844, now seen corresponding path program 36 times [2022-03-01 16:50:13,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:13,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424351534] [2022-03-01 16:50:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:13,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:13,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424351534] [2022-03-01 16:50:13,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424351534] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:13,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468986868] [2022-03-01 16:50:13,846 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:13,847 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-01 16:50:13,849 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-01 16:50:14,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:14,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:14,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:14,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:14,319 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-01 16:50:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:14,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:14,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468986868] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:14,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:14,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:14,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688411432] [2022-03-01 16:50:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:14,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:14,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:14,386 INFO L87 Difference]: Start difference. First operand 2617 states and 5114 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:15,281 INFO L93 Difference]: Finished difference Result 8063 states and 15869 transitions. [2022-03-01 16:50:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:50:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:15,291 INFO L225 Difference]: With dead ends: 8063 [2022-03-01 16:50:15,291 INFO L226 Difference]: Without dead ends: 8063 [2022-03-01 16:50:15,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:50:15,291 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 1196 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:15,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 1497 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2022-03-01 16:50:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 2615. [2022-03-01 16:50:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2607 states have (on average 1.9601074031453778) internal successors, (5110), 2614 states have internal predecessors, (5110), 0 states have call successors, (0), 0 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-01 16:50:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5110 transitions. [2022-03-01 16:50:15,333 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5110 transitions. Word has length 105 [2022-03-01 16:50:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:15,333 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 5110 transitions. [2022-03-01 16:50:15,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5110 transitions. [2022-03-01 16:50:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:15,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:15,334 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:15,354 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-01 16:50:15,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:15,551 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash -751493802, now seen corresponding path program 37 times [2022-03-01 16:50:15,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:15,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827012365] [2022-03-01 16:50:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:15,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:15,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827012365] [2022-03-01 16:50:15,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827012365] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:15,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558852418] [2022-03-01 16:50:15,674 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:15,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:15,675 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-01 16:50:15,676 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-01 16:50:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:15,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:15,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:16,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 13 treesize of output 9 [2022-03-01 16:50:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:16,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:16,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558852418] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:16,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:16,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:16,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532886084] [2022-03-01 16:50:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:16,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:16,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:16,165 INFO L87 Difference]: Start difference. First operand 2615 states and 5110 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:16,497 INFO L93 Difference]: Finished difference Result 5596 states and 10987 transitions. [2022-03-01 16:50:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:50:16,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:16,503 INFO L225 Difference]: With dead ends: 5596 [2022-03-01 16:50:16,503 INFO L226 Difference]: Without dead ends: 5596 [2022-03-01 16:50:16,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:50:16,503 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 562 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:16,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1354 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-03-01 16:50:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 2606. [2022-03-01 16:50:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2598 states have (on average 1.959969207082371) internal successors, (5092), 2605 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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-01 16:50:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 5092 transitions. [2022-03-01 16:50:16,535 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 5092 transitions. Word has length 105 [2022-03-01 16:50:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:16,535 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 5092 transitions. [2022-03-01 16:50:16,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 5092 transitions. [2022-03-01 16:50:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:16,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:16,537 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:16,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:16,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:16,751 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1780597932, now seen corresponding path program 38 times [2022-03-01 16:50:16,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:16,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102138514] [2022-03-01 16:50:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:16,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:16,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:16,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102138514] [2022-03-01 16:50:16,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102138514] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:16,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129214118] [2022-03-01 16:50:16,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:16,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:16,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:16,911 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-01 16:50:16,912 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-01 16:50:17,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:17,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:17,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:17,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:17,309 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-01 16:50:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:17,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:17,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129214118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:17,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:17,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:17,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800314867] [2022-03-01 16:50:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:17,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:17,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:17,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:17,391 INFO L87 Difference]: Start difference. First operand 2606 states and 5092 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:17,893 INFO L93 Difference]: Finished difference Result 6301 states and 12435 transitions. [2022-03-01 16:50:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:50:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:17,901 INFO L225 Difference]: With dead ends: 6301 [2022-03-01 16:50:17,905 INFO L226 Difference]: Without dead ends: 6301 [2022-03-01 16:50:17,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:50:17,906 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 822 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:17,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [822 Valid, 1425 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2022-03-01 16:50:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 2610. [2022-03-01 16:50:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2602 states have (on average 1.9600307455803228) internal successors, (5100), 2609 states have internal predecessors, (5100), 0 states have call successors, (0), 0 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-01 16:50:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 5100 transitions. [2022-03-01 16:50:17,941 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 5100 transitions. Word has length 105 [2022-03-01 16:50:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:17,941 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 5100 transitions. [2022-03-01 16:50:17,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 5100 transitions. [2022-03-01 16:50:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:17,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:17,942 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:17,960 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-01 16:50:18,156 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,SelfDestructingSolverStorable46 [2022-03-01 16:50:18,156 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1704099284, now seen corresponding path program 39 times [2022-03-01 16:50:18,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:18,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346827168] [2022-03-01 16:50:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:18,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:18,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346827168] [2022-03-01 16:50:18,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346827168] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:18,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609468094] [2022-03-01 16:50:18,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:18,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:18,265 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-01 16:50:18,266 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-01 16:50:18,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:18,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:18,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:18,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:18,622 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-01 16:50:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:18,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:18,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609468094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:18,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:18,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:18,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785101143] [2022-03-01 16:50:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:18,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:18,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:18,665 INFO L87 Difference]: Start difference. First operand 2610 states and 5100 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:19,260 INFO L93 Difference]: Finished difference Result 6524 states and 12843 transitions. [2022-03-01 16:50:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:50:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:19,267 INFO L225 Difference]: With dead ends: 6524 [2022-03-01 16:50:19,267 INFO L226 Difference]: Without dead ends: 6524 [2022-03-01 16:50:19,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:50:19,268 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1253 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:19,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1253 Valid, 1386 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2022-03-01 16:50:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 2608. [2022-03-01 16:50:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2600 states have (on average 1.96) internal successors, (5096), 2607 states have internal predecessors, (5096), 0 states have call successors, (0), 0 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-01 16:50:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-03-01 16:50:19,331 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-03-01 16:50:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:19,331 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-03-01 16:50:19,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-03-01 16:50:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:19,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:19,333 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:19,350 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-01 16:50:19,549 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,SelfDestructingSolverStorable47 [2022-03-01 16:50:19,550 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1195678366, now seen corresponding path program 40 times [2022-03-01 16:50:19,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:19,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763248419] [2022-03-01 16:50:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:19,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:19,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763248419] [2022-03-01 16:50:19,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763248419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:19,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688267426] [2022-03-01 16:50:19,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:50:19,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:19,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:19,709 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-01 16:50:19,711 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-01 16:50:19,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:50:19,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:19,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:50:19,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:20,132 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-01 16:50:20,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 11 treesize of output 7 [2022-03-01 16:50:20,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,282 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-01 16:50:20,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,314 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-01 16:50:20,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:20,354 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-01 16:50:20,393 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 9 [2022-03-01 16:50:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:20,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:20,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688267426] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:20,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:20,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 15 [2022-03-01 16:50:20,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423549956] [2022-03-01 16:50:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:20,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:50:20,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:50:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-01 16:50:20,404 INFO L87 Difference]: Start difference. First operand 2608 states and 5096 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-01 16:50:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:21,085 INFO L93 Difference]: Finished difference Result 5379 states and 10546 transitions. [2022-03-01 16:50:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:50:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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 105 [2022-03-01 16:50:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:21,092 INFO L225 Difference]: With dead ends: 5379 [2022-03-01 16:50:21,093 INFO L226 Difference]: Without dead ends: 5379 [2022-03-01 16:50:21,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:50:21,093 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 628 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:21,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 1411 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-03-01 16:50:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2605. [2022-03-01 16:50:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2597 states have (on average 1.9599537928378898) internal successors, (5090), 2604 states have internal predecessors, (5090), 0 states have call successors, (0), 0 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-01 16:50:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 5090 transitions. [2022-03-01 16:50:21,130 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 5090 transitions. Word has length 105 [2022-03-01 16:50:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:21,131 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 5090 transitions. [2022-03-01 16:50:21,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-01 16:50:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 5090 transitions. [2022-03-01 16:50:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:21,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:21,132 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:21,150 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-01 16:50:21,349 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,SelfDestructingSolverStorable48 [2022-03-01 16:50:21,350 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash 49907308, now seen corresponding path program 41 times [2022-03-01 16:50:21,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:21,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912926909] [2022-03-01 16:50:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:21,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:21,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912926909] [2022-03-01 16:50:21,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912926909] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:21,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030837742] [2022-03-01 16:50:21,507 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:21,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:21,509 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:50:21,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-01 16:50:21,786 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:21,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:21,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:21,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:21,953 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-01 16:50:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:22,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:22,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030837742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:22,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:22,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:22,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002874628] [2022-03-01 16:50:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:22,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:22,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:22,110 INFO L87 Difference]: Start difference. First operand 2605 states and 5090 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:22,455 INFO L93 Difference]: Finished difference Result 4902 states and 9651 transitions. [2022-03-01 16:50:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:50:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-03-01 16:50:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:22,461 INFO L225 Difference]: With dead ends: 4902 [2022-03-01 16:50:22,461 INFO L226 Difference]: Without dead ends: 4902 [2022-03-01 16:50:22,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:22,462 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 562 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:22,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1394 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-03-01 16:50:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 2634. [2022-03-01 16:50:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2626 states have (on average 1.9603960396039604) internal successors, (5148), 2633 states have internal predecessors, (5148), 0 states have call successors, (0), 0 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-01 16:50:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 5148 transitions. [2022-03-01 16:50:22,496 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 5148 transitions. Word has length 105 [2022-03-01 16:50:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:22,496 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 5148 transitions. [2022-03-01 16:50:22,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-01 16:50:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 5148 transitions. [2022-03-01 16:50:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 16:50:22,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:22,497 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 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, 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-01 16:50:22,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:22,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:22,715 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash 225817577, now seen corresponding path program 1 times [2022-03-01 16:50:22,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:22,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524602940] [2022-03-01 16:50:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-01 16:50:22,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:22,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524602940] [2022-03-01 16:50:22,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524602940] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:22,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:22,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:22,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551092706] [2022-03-01 16:50:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:22,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:22,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:22,769 INFO L87 Difference]: Start difference. First operand 2634 states and 5148 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 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-01 16:50:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:22,868 INFO L93 Difference]: Finished difference Result 2900 states and 5680 transitions. [2022-03-01 16:50:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 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 114 [2022-03-01 16:50:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:22,874 INFO L225 Difference]: With dead ends: 2900 [2022-03-01 16:50:22,874 INFO L226 Difference]: Without dead ends: 2753 [2022-03-01 16:50:22,874 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-01 16:50:22,874 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 128 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:22,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 366 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:50:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2022-03-01 16:50:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2211. [2022-03-01 16:50:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2204 states have (on average 1.9491833030852994) internal successors, (4296), 2210 states have internal predecessors, (4296), 0 states have call successors, (0), 0 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-01 16:50:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4296 transitions. [2022-03-01 16:50:22,894 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4296 transitions. Word has length 114 [2022-03-01 16:50:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:22,894 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 4296 transitions. [2022-03-01 16:50:22,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 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-01 16:50:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4296 transitions. [2022-03-01 16:50:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:50:22,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:22,896 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:22,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-01 16:50:22,896 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1779983633, now seen corresponding path program 1 times [2022-03-01 16:50:22,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:22,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101239418] [2022-03-01 16:50:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:23,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:23,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101239418] [2022-03-01 16:50:23,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101239418] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:23,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176101755] [2022-03-01 16:50:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:23,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:23,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:23,155 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:50:23,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-01 16:50:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:23,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-01 16:50:23,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:24,228 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-01 16:50:24,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,267 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-01 16:50:24,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,307 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-01 16:50:24,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,360 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-01 16:50:24,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:24,474 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-01 16:50:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:24,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:24,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:24,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:25,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176101755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:50:25,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:50:25,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:50:25,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610436535] [2022-03-01 16:50:25,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:50:25,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:50:25,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:50:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:50:25,567 INFO L87 Difference]: Start difference. First operand 2211 states and 4296 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:50:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:28,103 INFO L93 Difference]: Finished difference Result 7926 states and 15628 transitions. [2022-03-01 16:50:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-01 16:50:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:50:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:28,113 INFO L225 Difference]: With dead ends: 7926 [2022-03-01 16:50:28,113 INFO L226 Difference]: Without dead ends: 7914 [2022-03-01 16:50:28,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-03-01 16:50:28,115 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 2423 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:28,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 3947 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2912 Invalid, 0 Unknown, 220 Unchecked, 1.2s Time] [2022-03-01 16:50:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-03-01 16:50:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 3015. [2022-03-01 16:50:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3015 states, 3008 states have (on average 1.9763962765957446) internal successors, (5945), 3014 states have internal predecessors, (5945), 0 states have call successors, (0), 0 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-01 16:50:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5945 transitions. [2022-03-01 16:50:28,160 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5945 transitions. Word has length 134 [2022-03-01 16:50:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:28,160 INFO L470 AbstractCegarLoop]: Abstraction has 3015 states and 5945 transitions. [2022-03-01 16:50:28,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:50:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5945 transitions. [2022-03-01 16:50:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:50:28,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:28,163 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:28,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:28,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:28,380 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2062391747, now seen corresponding path program 2 times [2022-03-01 16:50:28,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:28,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13496047] [2022-03-01 16:50:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:28,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:28,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13496047] [2022-03-01 16:50:28,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13496047] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:28,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838015567] [2022-03-01 16:50:28,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:28,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:28,688 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:50:28,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-01 16:50:29,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:50:29,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:29,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:50:29,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:29,638 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-01 16:50:29,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,675 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-01 16:50:29,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,726 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-01 16:50:29,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:29,776 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-01 16:50:29,886 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-01 16:50:29,887 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 51 treesize of output 59 [2022-03-01 16:50:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:29,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:30,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:30,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838015567] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:50:30,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:50:30,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:50:30,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235522112] [2022-03-01 16:50:30,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:50:30,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:50:30,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:50:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:50:30,944 INFO L87 Difference]: Start difference. First operand 3015 states and 5945 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:50:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:33,978 INFO L93 Difference]: Finished difference Result 7629 states and 15050 transitions. [2022-03-01 16:50:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-01 16:50:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:50:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:33,989 INFO L225 Difference]: With dead ends: 7629 [2022-03-01 16:50:33,989 INFO L226 Difference]: Without dead ends: 7620 [2022-03-01 16:50:33,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-03-01 16:50:33,990 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1997 mSDsluCounter, 4464 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:33,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1997 Valid, 4794 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3952 Invalid, 0 Unknown, 279 Unchecked, 1.7s Time] [2022-03-01 16:50:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2022-03-01 16:50:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 3152. [2022-03-01 16:50:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3145 states have (on average 1.9774244833068362) internal successors, (6219), 3151 states have internal predecessors, (6219), 0 states have call successors, (0), 0 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-01 16:50:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 6219 transitions. [2022-03-01 16:50:34,038 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 6219 transitions. Word has length 134 [2022-03-01 16:50:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:34,039 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 6219 transitions. [2022-03-01 16:50:34,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:50:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 6219 transitions. [2022-03-01 16:50:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:50:34,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:34,042 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:34,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:34,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:34,255 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1179672212, now seen corresponding path program 1 times [2022-03-01 16:50:34,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:34,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591130467] [2022-03-01 16:50:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:34,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:34,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591130467] [2022-03-01 16:50:34,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591130467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:34,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200856921] [2022-03-01 16:50:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:34,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:34,476 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:50:34,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-01 16:50:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:34,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:50:34,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:35,141 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-01 16:50:35,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,186 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-01 16:50:35,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,214 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-01 16:50:35,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:35,248 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-01 16:50:35,322 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:50:35,323 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-01 16:50:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:35,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:35,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:35,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:36,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200856921] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:50:36,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:50:36,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:50:36,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458244948] [2022-03-01 16:50:36,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:50:36,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:50:36,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:50:36,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:50:36,376 INFO L87 Difference]: Start difference. First operand 3152 states and 6219 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:50:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:39,309 INFO L93 Difference]: Finished difference Result 7625 states and 15041 transitions. [2022-03-01 16:50:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 16:50:39,310 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:50:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:39,319 INFO L225 Difference]: With dead ends: 7625 [2022-03-01 16:50:39,319 INFO L226 Difference]: Without dead ends: 7597 [2022-03-01 16:50:39,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1163, Invalid=5977, Unknown=0, NotChecked=0, Total=7140 [2022-03-01 16:50:39,320 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 2466 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:39,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2466 Valid, 4041 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3229 Invalid, 0 Unknown, 498 Unchecked, 1.4s Time] [2022-03-01 16:50:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2022-03-01 16:50:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 3312. [2022-03-01 16:50:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3305 states have (on average 1.9797276853252648) internal successors, (6543), 3311 states have internal predecessors, (6543), 0 states have call successors, (0), 0 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-01 16:50:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 6543 transitions. [2022-03-01 16:50:39,362 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 6543 transitions. Word has length 134 [2022-03-01 16:50:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:39,362 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 6543 transitions. [2022-03-01 16:50:39,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:50:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 6543 transitions. [2022-03-01 16:50:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:50:39,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:39,365 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:39,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:39,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-01 16:50:39,582 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:50:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -839246923, now seen corresponding path program 1 times [2022-03-01 16:50:39,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:39,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429428039] [2022-03-01 16:50:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:40,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:40,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429428039] [2022-03-01 16:50:40,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429428039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:40,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209277375] [2022-03-01 16:50:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:40,042 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:50:40,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-01 16:50:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:40,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-01 16:50:40,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:41,065 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-01 16:50:41,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,113 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-01 16:50:41,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,167 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-01 16:50:41,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,228 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-01 16:50:41,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,342 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-01 16:50:41,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,370 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-01 16:50:41,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,396 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-01 16:50:41,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,426 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-01 16:50:41,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:41,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2022-03-01 16:50:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:47,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:48,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:48,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:50:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:49,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209277375] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:50:49,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:50:49,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-03-01 16:50:49,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269214462] [2022-03-01 16:50:49,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:50:49,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-01 16:50:49,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-01 16:50:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1739, Unknown=2, NotChecked=0, Total=1980 [2022-03-01 16:50:49,679 INFO L87 Difference]: Start difference. First operand 3312 states and 6543 transitions. Second operand has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:51:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:51:28,791 INFO L93 Difference]: Finished difference Result 9029 states and 17852 transitions. [2022-03-01 16:51:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 16:51:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:51:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:51:28,805 INFO L225 Difference]: With dead ends: 9029 [2022-03-01 16:51:28,805 INFO L226 Difference]: Without dead ends: 9017 [2022-03-01 16:51:28,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=1670, Invalid=8614, Unknown=18, NotChecked=0, Total=10302 [2022-03-01 16:51:28,807 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 2878 mSDsluCounter, 4767 mSDsCounter, 0 mSdLazyCounter, 4140 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2878 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 5818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 4140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1332 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:51:28,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2878 Valid, 5121 Invalid, 5818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 4140 Invalid, 0 Unknown, 1332 Unchecked, 2.3s Time] [2022-03-01 16:51:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2022-03-01 16:51:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 3517. [2022-03-01 16:51:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3510 states have (on average 1.9814814814814814) internal successors, (6955), 3516 states have internal predecessors, (6955), 0 states have call successors, (0), 0 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-01 16:51:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 6955 transitions. [2022-03-01 16:51:28,906 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 6955 transitions. Word has length 134 [2022-03-01 16:51:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:51:28,906 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 6955 transitions. [2022-03-01 16:51:28,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:51:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 6955 transitions. [2022-03-01 16:51:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:51:28,909 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:51:28,909 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-01 16:51:28,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-01 16:51:29,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-01 16:51:29,122 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:51:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:51:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1180858669, now seen corresponding path program 1 times [2022-03-01 16:51:29,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:51:29,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618814385] [2022-03-01 16:51:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:51:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:51:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:29,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:51:29,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618814385] [2022-03-01 16:51:29,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618814385] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:29,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372343300] [2022-03-01 16:51:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:29,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:51:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:51:29,300 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:51:29,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-01 16:51:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:51:29,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:51:29,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:51:30,240 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-01 16:51:30,280 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-03-01 16:51:30,280 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 26 treesize of output 25 [2022-03-01 16:51:30,307 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-01 16:51:30,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, 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-01 16:51:30,348 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-01 16:51:30,348 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-01 16:51:30,399 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 16:51:30,399 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-01 16:51:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:30,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:51:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:30,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372343300] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:51:30,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:51:30,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-03-01 16:51:30,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454550417] [2022-03-01 16:51:30,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:51:30,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 16:51:30,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:51:30,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 16:51:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:51:30,926 INFO L87 Difference]: Start difference. First operand 3517 states and 6955 transitions. Second operand has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-01 16:51:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:51:35,914 INFO L93 Difference]: Finished difference Result 7638 states and 15074 transitions. [2022-03-01 16:51:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-01 16:51:35,915 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 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 134 [2022-03-01 16:51:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:51:35,923 INFO L225 Difference]: With dead ends: 7638 [2022-03-01 16:51:35,923 INFO L226 Difference]: Without dead ends: 7610 [2022-03-01 16:51:35,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1853, Invalid=9919, Unknown=0, NotChecked=0, Total=11772 [2022-03-01 16:51:35,925 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 2670 mSDsluCounter, 4644 mSDsCounter, 0 mSdLazyCounter, 5177 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 5058 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:51:35,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2670 Valid, 5058 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5177 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-01 16:51:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-01 16:51:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 3445. [2022-03-01 16:51:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3438 states have (on average 1.973240255962769) internal successors, (6784), 3444 states have internal predecessors, (6784), 0 states have call successors, (0), 0 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-01 16:51:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6784 transitions. [2022-03-01 16:51:35,979 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6784 transitions. Word has length 134 [2022-03-01 16:51:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:51:35,980 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 6784 transitions. [2022-03-01 16:51:35,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-01 16:51:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6784 transitions. [2022-03-01 16:51:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:51:35,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:51:35,983 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:51:36,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-01 16:51:36,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-01 16:51:36,201 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:51:36,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:51:36,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1411337857, now seen corresponding path program 3 times [2022-03-01 16:51:36,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:51:36,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176902320] [2022-03-01 16:51:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:51:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:51:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:36,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:51:36,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176902320] [2022-03-01 16:51:36,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176902320] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:36,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399551818] [2022-03-01 16:51:36,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:51:36,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:51:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:51:36,431 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:51:36,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-01 16:51:36,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 16:51:36,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:51:36,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-01 16:51:36,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:51:37,580 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-01 16:51:37,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,618 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-01 16:51:37,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,668 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-01 16:51:37,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,721 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-01 16:51:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:37,886 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-01 16:51:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:37,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:51:38,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) is different from false [2022-03-01 16:51:39,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2022-03-01 16:51:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-01 16:51:56,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399551818] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:51:56,264 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:51:56,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:51:56,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665260753] [2022-03-01 16:51:56,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:51:56,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:51:56,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:51:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:51:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1290, Unknown=13, NotChecked=150, Total=1640 [2022-03-01 16:51:56,265 INFO L87 Difference]: Start difference. First operand 3445 states and 6784 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:51:58,344 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:51:58,996 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:52:01,584 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:52:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:02,753 INFO L93 Difference]: Finished difference Result 11852 states and 23499 transitions. [2022-03-01 16:52:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-01 16:52:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:52:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:02,769 INFO L225 Difference]: With dead ends: 11852 [2022-03-01 16:52:02,769 INFO L226 Difference]: Without dead ends: 11849 [2022-03-01 16:52:02,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1503, Invalid=7243, Unknown=16, NotChecked=940, Total=9702 [2022-03-01 16:52:02,770 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 2421 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 3853 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 5544 SdHoareTripleChecker+Invalid, 5224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 3853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1211 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:02,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2421 Valid, 5544 Invalid, 5224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 3853 Invalid, 0 Unknown, 1211 Unchecked, 2.1s Time] [2022-03-01 16:52:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2022-03-01 16:52:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 3467. [2022-03-01 16:52:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3467 states, 3460 states have (on average 1.9734104046242775) internal successors, (6828), 3466 states have internal predecessors, (6828), 0 states have call successors, (0), 0 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-01 16:52:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 6828 transitions. [2022-03-01 16:52:02,843 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 6828 transitions. Word has length 134 [2022-03-01 16:52:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:02,843 INFO L470 AbstractCegarLoop]: Abstraction has 3467 states and 6828 transitions. [2022-03-01 16:52:02,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:52:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 6828 transitions. [2022-03-01 16:52:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:02,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:02,846 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:02,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-01 16:52:03,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-01 16:52:03,053 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:52:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1408959273, now seen corresponding path program 4 times [2022-03-01 16:52:03,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:03,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518041925] [2022-03-01 16:52:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:03,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:03,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518041925] [2022-03-01 16:52:03,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518041925] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:03,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621459113] [2022-03-01 16:52:03,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:52:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:03,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:03,310 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:52:03,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-01 16:52:03,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:52:03,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:03,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:52:03,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:04,543 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-01 16:52:04,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,576 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-01 16:52:04,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,624 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-01 16:52:04,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,747 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-01 16:52:04,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:52:04,849 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 6 case distinctions, treesize of input 50 treesize of output 58 [2022-03-01 16:52:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:04,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:36,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621459113] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:52:36,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:52:36,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2022-03-01 16:52:36,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654291103] [2022-03-01 16:52:36,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:52:36,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-01 16:52:36,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-01 16:52:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1512, Unknown=24, NotChecked=0, Total=1722 [2022-03-01 16:52:36,614 INFO L87 Difference]: Start difference. First operand 3467 states and 6828 transitions. Second operand has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:52:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:40,211 INFO L93 Difference]: Finished difference Result 8509 states and 16826 transitions. [2022-03-01 16:52:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-01 16:52:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:52:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:40,222 INFO L225 Difference]: With dead ends: 8509 [2022-03-01 16:52:40,222 INFO L226 Difference]: Without dead ends: 8509 [2022-03-01 16:52:40,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2573 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=1353, Invalid=7179, Unknown=24, NotChecked=0, Total=8556 [2022-03-01 16:52:40,223 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1780 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 5336 SdHoareTripleChecker+Invalid, 4581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1640 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:40,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1780 Valid, 5336 Invalid, 4581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2836 Invalid, 0 Unknown, 1640 Unchecked, 1.5s Time] [2022-03-01 16:52:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8509 states. [2022-03-01 16:52:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8509 to 3501. [2022-03-01 16:52:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3494 states have (on average 1.9736691471093304) internal successors, (6896), 3500 states have internal predecessors, (6896), 0 states have call successors, (0), 0 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-01 16:52:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 6896 transitions. [2022-03-01 16:52:40,286 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 6896 transitions. Word has length 134 [2022-03-01 16:52:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:40,286 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 6896 transitions. [2022-03-01 16:52:40,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:52:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 6896 transitions. [2022-03-01 16:52:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:40,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:40,290 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:40,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-01 16:52:40,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-01 16:52:40,503 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:52:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1990777503, now seen corresponding path program 5 times [2022-03-01 16:52:40,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:40,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132647101] [2022-03-01 16:52:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:40,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:40,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132647101] [2022-03-01 16:52:40,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132647101] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:40,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096680634] [2022-03-01 16:52:40,804 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:52:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:40,806 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:52:40,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-01 16:52:41,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:52:41,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:41,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:52:41,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:41,928 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-01 16:52:41,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:41,963 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-01 16:52:42,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,002 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-01 16:52:42,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:42,100 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-01 16:52:42,208 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-01 16:52:42,208 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 51 treesize of output 59 [2022-03-01 16:52:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:42,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:56,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)) (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5810 Int)) (= (select (select (let ((.cse1 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-03-01 16:52:58,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)))) is different from false [2022-03-01 16:52:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:59,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096680634] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:52:59,531 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:52:59,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:52:59,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298506488] [2022-03-01 16:52:59,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:52:59,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:52:59,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:52:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1309, Unknown=16, NotChecked=150, Total=1640 [2022-03-01 16:52:59,532 INFO L87 Difference]: Start difference. First operand 3501 states and 6896 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:02,167 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (= |c_~#cache~0.base| 1) (<= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (<= (div (+ .cse7 |c_~#cache~0.offset|) (- 28)) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse7) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-01 16:53:02,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)) (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5810 Int)) (= (select (select (let ((.cse1 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-01 16:53:07,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (= |c_~#cache~0.base| 1) (<= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (<= (div (+ .cse7 |c_~#cache~0.offset|) (- 28)) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse7) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|))) is different from false [2022-03-01 16:53:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:08,772 INFO L93 Difference]: Finished difference Result 12517 states and 24827 transitions. [2022-03-01 16:53:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-01 16:53:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:53:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:08,791 INFO L225 Difference]: With dead ends: 12517 [2022-03-01 16:53:08,791 INFO L226 Difference]: Without dead ends: 12511 [2022-03-01 16:53:08,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=1028, Invalid=5289, Unknown=23, NotChecked=800, Total=7140 [2022-03-01 16:53:08,792 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 1912 mSDsluCounter, 4910 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 5284 SdHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2474 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:08,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1912 Valid, 5284 Invalid, 5629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 3050 Invalid, 0 Unknown, 2474 Unchecked, 1.7s Time] [2022-03-01 16:53:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2022-03-01 16:53:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 3557. [2022-03-01 16:53:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3550 states have (on average 1.9740845070422535) internal successors, (7008), 3556 states have internal predecessors, (7008), 0 states have call successors, (0), 0 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-01 16:53:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 7008 transitions. [2022-03-01 16:53:08,889 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 7008 transitions. Word has length 134 [2022-03-01 16:53:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:08,889 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 7008 transitions. [2022-03-01 16:53:08,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 7008 transitions. [2022-03-01 16:53:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:08,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:08,892 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:08,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:09,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-01 16:53:09,100 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:53:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash -467560269, now seen corresponding path program 6 times [2022-03-01 16:53:09,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:09,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156022744] [2022-03-01 16:53:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:09,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:09,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156022744] [2022-03-01 16:53:09,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156022744] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:09,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868076697] [2022-03-01 16:53:09,381 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:53:09,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:09,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:09,382 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:09,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-01 16:53:09,798 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 16:53:09,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:09,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-01 16:53:09,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:10,666 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-01 16:53:10,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,709 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-01 16:53:10,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,795 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-01 16:53:10,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,851 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-01 16:53:10,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:10,977 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-01 16:53:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:11,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:12,024 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (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|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) is different from false [2022-03-01 16:53:12,902 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) is different from false [2022-03-01 16:53:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-01 16:53:13,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868076697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:13,382 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:13,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:53:13,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295289450] [2022-03-01 16:53:13,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:13,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:53:13,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:53:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1324, Unknown=2, NotChecked=150, Total=1640 [2022-03-01 16:53:13,383 INFO L87 Difference]: Start difference. First operand 3557 states and 7008 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:15,238 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-03-01 16:53:16,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2022-03-01 16:53:19,172 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-03-01 16:53:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:20,533 INFO L93 Difference]: Finished difference Result 12508 states and 24812 transitions. [2022-03-01 16:53:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-01 16:53:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:53:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:20,556 INFO L225 Difference]: With dead ends: 12508 [2022-03-01 16:53:20,556 INFO L226 Difference]: Without dead ends: 12499 [2022-03-01 16:53:20,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1881, Invalid=10566, Unknown=5, NotChecked=1120, Total=13572 [2022-03-01 16:53:20,558 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 2345 mSDsluCounter, 5578 mSDsCounter, 0 mSdLazyCounter, 4473 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 5991 SdHoareTripleChecker+Invalid, 6154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1517 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:20,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2345 Valid, 5991 Invalid, 6154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4473 Invalid, 0 Unknown, 1517 Unchecked, 2.4s Time] [2022-03-01 16:53:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12499 states. [2022-03-01 16:53:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12499 to 3616. [2022-03-01 16:53:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 3609 states have (on average 1.9745081740094208) internal successors, (7126), 3615 states have internal predecessors, (7126), 0 states have call successors, (0), 0 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-01 16:53:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 7126 transitions. [2022-03-01 16:53:20,649 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 7126 transitions. Word has length 134 [2022-03-01 16:53:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:20,649 INFO L470 AbstractCegarLoop]: Abstraction has 3616 states and 7126 transitions. [2022-03-01 16:53:20,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 7126 transitions. [2022-03-01 16:53:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:20,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:20,653 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:20,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:20,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:20,873 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:53:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash 416790693, now seen corresponding path program 7 times [2022-03-01 16:53:20,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:20,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544371886] [2022-03-01 16:53:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:21,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:21,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544371886] [2022-03-01 16:53:21,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544371886] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:21,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329109327] [2022-03-01 16:53:21,173 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:53:21,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:21,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:21,174 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:21,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-01 16:53:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:21,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-01 16:53:21,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:22,418 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-01 16:53:22,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,494 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-01 16:53:22,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,560 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-01 16:53:22,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,613 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-01 16:53:22,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:22,733 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-01 16:53:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:22,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:24,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| Int)) (or (and (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (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|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82|)))) is different from false [2022-03-01 16:53:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-01 16:53:25,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329109327] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:25,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:25,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-01 16:53:25,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877733755] [2022-03-01 16:53:25,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:25,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:53:25,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:53:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1385, Unknown=1, NotChecked=76, Total=1640 [2022-03-01 16:53:25,499 INFO L87 Difference]: Start difference. First operand 3616 states and 7126 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:27,600 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| Int)) (or (and (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (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|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82|)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-03-01 16:53:30,740 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| Int)) (or (and (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (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|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82|)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-03-01 16:53:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:33,547 INFO L93 Difference]: Finished difference Result 12522 states and 24837 transitions. [2022-03-01 16:53:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-01 16:53:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:53:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:33,568 INFO L225 Difference]: With dead ends: 12522 [2022-03-01 16:53:33,569 INFO L226 Difference]: Without dead ends: 12498 [2022-03-01 16:53:33,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1995, Invalid=10670, Unknown=3, NotChecked=672, Total=13340 [2022-03-01 16:53:33,570 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 2390 mSDsluCounter, 6103 mSDsCounter, 0 mSdLazyCounter, 5504 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 6497 SdHoareTripleChecker+Invalid, 7305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 5504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1595 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:33,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2390 Valid, 6497 Invalid, 7305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 5504 Invalid, 0 Unknown, 1595 Unchecked, 3.0s Time] [2022-03-01 16:53:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12498 states. [2022-03-01 16:53:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12498 to 3645. [2022-03-01 16:53:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3638 states have (on average 1.9747113798790543) internal successors, (7184), 3644 states have internal predecessors, (7184), 0 states have call successors, (0), 0 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-01 16:53:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 7184 transitions. [2022-03-01 16:53:33,663 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 7184 transitions. Word has length 134 [2022-03-01 16:53:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:33,663 INFO L470 AbstractCegarLoop]: Abstraction has 3645 states and 7184 transitions. [2022-03-01 16:53:33,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 7184 transitions. [2022-03-01 16:53:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:33,666 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:33,666 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:33,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:33,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:33,885 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:53:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1462386007, now seen corresponding path program 2 times [2022-03-01 16:53:33,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:33,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109958501] [2022-03-01 16:53:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:34,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:34,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109958501] [2022-03-01 16:53:34,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109958501] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:34,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415154400] [2022-03-01 16:53:34,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:53:34,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:34,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:34,261 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:34,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-01 16:53:34,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:53:34,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:34,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-01 16:53:34,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:35,180 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-01 16:53:35,251 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-01 16:53:35,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,299 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-01 16:53:35,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,343 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-01 16:53:35,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,442 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-01 16:53:35,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 16:53:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,646 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-01 16:53:35,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,673 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-01 16:53:35,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,700 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-01 16:53:35,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:35,727 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-01 16:53:35,837 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-01 16:53:35,837 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 51 treesize of output 59 [2022-03-01 16:53:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:35,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:51,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:51,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:51,663 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 10 treesize of output 4 [2022-03-01 16:53:51,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:51,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:51,671 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 10 treesize of output 4 [2022-03-01 16:53:51,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:51,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:51,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:51,684 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 10 treesize of output 4 [2022-03-01 16:53:51,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:51,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:51,690 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 10 treesize of output 4 [2022-03-01 16:53:51,697 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 16:53:51,701 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 16:53:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:52,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415154400] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:52,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:52,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 46 [2022-03-01 16:53:52,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113086872] [2022-03-01 16:53:52,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:52,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-01 16:53:52,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-01 16:53:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1910, Unknown=6, NotChecked=0, Total=2162 [2022-03-01 16:53:52,156 INFO L87 Difference]: Start difference. First operand 3645 states and 7184 transitions. Second operand has 47 states, 46 states have (on average 5.130434782608695) internal successors, (236), 47 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:57,659 INFO L93 Difference]: Finished difference Result 9457 states and 18712 transitions. [2022-03-01 16:53:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-01 16:53:57,660 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 5.130434782608695) internal successors, (236), 47 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:53:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:57,670 INFO L225 Difference]: With dead ends: 9457 [2022-03-01 16:53:57,670 INFO L226 Difference]: Without dead ends: 9451 [2022-03-01 16:53:57,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 255 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3277 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1877, Invalid=9247, Unknown=6, NotChecked=0, Total=11130 [2022-03-01 16:53:57,671 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 2552 mSDsluCounter, 6008 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2552 SdHoareTripleChecker+Valid, 6404 SdHoareTripleChecker+Invalid, 6086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1552 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:57,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2552 Valid, 6404 Invalid, 6086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 4257 Invalid, 0 Unknown, 1552 Unchecked, 2.4s Time] [2022-03-01 16:53:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9451 states. [2022-03-01 16:53:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9451 to 3681. [2022-03-01 16:53:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3674 states have (on average 1.974959172563963) internal successors, (7256), 3680 states have internal predecessors, (7256), 0 states have call successors, (0), 0 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-01 16:53:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 7256 transitions. [2022-03-01 16:53:57,724 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 7256 transitions. Word has length 134 [2022-03-01 16:53:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:57,725 INFO L470 AbstractCegarLoop]: Abstraction has 3681 states and 7256 transitions. [2022-03-01 16:53:57,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 5.130434782608695) internal successors, (236), 47 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:53:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 7256 transitions. [2022-03-01 16:53:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:57,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:57,727 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:57,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:57,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:57,944 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:53:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:57,945 INFO L85 PathProgramCache]: Analyzing trace with hash -165019217, now seen corresponding path program 3 times [2022-03-01 16:53:57,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:57,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502272052] [2022-03-01 16:53:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:58,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:58,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502272052] [2022-03-01 16:53:58,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502272052] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:58,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474927528] [2022-03-01 16:53:58,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:53:58,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:58,367 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:58,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-01 16:53:58,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 16:53:58,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:58,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-01 16:53:58,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:59,430 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-01 16:53:59,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,469 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-01 16:53:59,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,513 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-01 16:53:59,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,605 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-01 16:53:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,711 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-01 16:53:59,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,740 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-01 16:53:59,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,766 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-01 16:53:59,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,795 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-01 16:53:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:59,921 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-01 16:53:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:59,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:54:13,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (and (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (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) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= 0 (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_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= 0 (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse5 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) is different from false [2022-03-01 16:54:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:54:17,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474927528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:54:17,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:54:17,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 42 [2022-03-01 16:54:17,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774855370] [2022-03-01 16:54:17,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:54:17,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-01 16:54:17,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-01 16:54:17,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1539, Unknown=6, NotChecked=80, Total=1806 [2022-03-01 16:54:17,283 INFO L87 Difference]: Start difference. First operand 3681 states and 7256 transitions. Second operand has 43 states, 42 states have (on average 5.619047619047619) internal successors, (236), 43 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:54:20,978 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (and (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (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) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= 0 (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_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= 0 (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse5 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-03-01 16:54:25,834 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (and (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (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) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= 0 (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_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= 0 (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse5 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 3) v_ArrVal_6434) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_6436))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-03-01 16:54:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:28,267 INFO L93 Difference]: Finished difference Result 18643 states and 37124 transitions. [2022-03-01 16:54:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-01 16:54:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 5.619047619047619) internal successors, (236), 43 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-03-01 16:54:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:28,300 INFO L225 Difference]: With dead ends: 18643 [2022-03-01 16:54:28,301 INFO L226 Difference]: Without dead ends: 18637 [2022-03-01 16:54:28,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 260 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3731 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1839, Invalid=10375, Unknown=8, NotChecked=660, Total=12882 [2022-03-01 16:54:28,302 INFO L933 BasicCegarLoop]: 460 mSDtfsCounter, 2875 mSDsluCounter, 7086 mSDsCounter, 0 mSdLazyCounter, 5573 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2875 SdHoareTripleChecker+Valid, 7545 SdHoareTripleChecker+Invalid, 8931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 5573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3140 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:28,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2875 Valid, 7545 Invalid, 8931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 5573 Invalid, 0 Unknown, 3140 Unchecked, 3.3s Time] [2022-03-01 16:54:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18637 states. [2022-03-01 16:54:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18637 to 3743. [2022-03-01 16:54:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 3736 states have (on average 1.9753747323340471) internal successors, (7380), 3742 states have internal predecessors, (7380), 0 states have call successors, (0), 0 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-01 16:54:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 7380 transitions. [2022-03-01 16:54:28,429 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 7380 transitions. Word has length 134 [2022-03-01 16:54:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:28,429 INFO L470 AbstractCegarLoop]: Abstraction has 3743 states and 7380 transitions. [2022-03-01 16:54:28,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 5.619047619047619) internal successors, (236), 43 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-01 16:54:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 7380 transitions. [2022-03-01 16:54:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:54:28,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:28,433 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:28,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-01 16:54:28,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-03-01 16:54:28,656 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 16:54:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 768196573, now seen corresponding path program 4 times [2022-03-01 16:54:28,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:28,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480531529] [2022-03-01 16:54:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:54:29,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:29,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480531529] [2022-03-01 16:54:29,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480531529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:54:29,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635909283] [2022-03-01 16:54:29,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:54:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:54:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:54:29,125 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:54:29,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-01 16:54:29,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:54:29,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:54:29,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-01 16:54:29,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:54:30,117 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-01 16:54:30,169 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-01 16:54:30,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,207 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-01 16:54:30,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,290 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-01 16:54:30,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,340 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-01 16:54:30,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,398 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:54:30,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-03-01 16:54:30,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,481 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:54:30,482 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 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-01 16:54:30,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,527 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:54:30,528 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-03-01 16:54:30,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,558 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:54:30,558 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-03-01 16:54:30,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:54:30,580 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 6 case distinctions, treesize of input 48 treesize of output 56 [2022-03-01 16:54:30,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:30,785 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:54:30,785 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 21 case distinctions, treesize of input 86 treesize of output 103 [2022-03-01 16:54:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:54:40,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:54:58,538 INFO L353 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-03-01 16:54:58,539 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 33212 treesize of output 33204 [2022-03-01 16:54:59,259 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 16:54:59,260 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 20620 treesize of output 20612 [2022-03-01 16:54:59,334 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-01 16:54:59,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-01 16:54:59,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-03-01 16:54:59,553 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-01 16:54:59,557 INFO L158 Benchmark]: Toolchain (without parser) took 353109.34ms. Allocated memory was 208.7MB in the beginning and 610.3MB in the end (delta: 401.6MB). Free memory was 151.4MB in the beginning and 385.9MB in the end (delta: -234.5MB). Peak memory consumption was 346.0MB. Max. memory is 8.0GB. [2022-03-01 16:54:59,557 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 208.7MB. Free memory was 169.5MB in the beginning and 169.5MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 16:54:59,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.94ms. Allocated memory was 208.7MB in the beginning and 327.2MB in the end (delta: 118.5MB). Free memory was 151.1MB in the beginning and 281.1MB in the end (delta: -130.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-01 16:54:59,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.79ms. Allocated memory is still 327.2MB. Free memory was 281.1MB in the beginning and 279.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 16:54:59,557 INFO L158 Benchmark]: Boogie Preprocessor took 33.09ms. Allocated memory is still 327.2MB. Free memory was 279.1MB in the beginning and 276.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 16:54:59,557 INFO L158 Benchmark]: RCFGBuilder took 358.01ms. Allocated memory is still 327.2MB. Free memory was 276.4MB in the beginning and 261.2MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-01 16:54:59,557 INFO L158 Benchmark]: TraceAbstraction took 352176.42ms. Allocated memory was 327.2MB in the beginning and 610.3MB in the end (delta: 283.1MB). Free memory was 260.7MB in the beginning and 385.9MB in the end (delta: -125.2MB). Peak memory consumption was 337.8MB. Max. memory is 8.0GB. [2022-03-01 16:54:59,558 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.26ms. Allocated memory is still 208.7MB. Free memory was 169.5MB in the beginning and 169.5MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.94ms. Allocated memory was 208.7MB in the beginning and 327.2MB in the end (delta: 118.5MB). Free memory was 151.1MB in the beginning and 281.1MB in the end (delta: -130.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.79ms. Allocated memory is still 327.2MB. Free memory was 281.1MB in the beginning and 279.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.09ms. Allocated memory is still 327.2MB. Free memory was 279.1MB in the beginning and 276.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 358.01ms. Allocated memory is still 327.2MB. Free memory was 276.4MB in the beginning and 261.2MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 352176.42ms. Allocated memory was 327.2MB in the beginning and 610.3MB in the end (delta: 283.1MB). Free memory was 260.7MB in the beginning and 385.9MB in the end (delta: -125.2MB). Peak memory consumption was 337.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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-01 16:54:59,787 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-01 16:54:59,817 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 137 Received shutdown request...