/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-03 18:21:31,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:21:31,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:21:31,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:21:31,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:21:31,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:21:31,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:21:31,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:21:31,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:21:31,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:21:31,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:21:31,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:21:31,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:21:31,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:21:31,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:21:31,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:21:31,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:21:31,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:21:31,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:21:31,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:21:31,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:21:31,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:21:31,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:21:31,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:21:31,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:21:31,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:21:31,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:21:31,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:21:31,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:21:31,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:21:31,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:21:31,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:21:31,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:21:31,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:21:31,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:21:31,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:21:31,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:21:31,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:21:31,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:21:31,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:21:31,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:21:31,157 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-03 18:21:31,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:21:31,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:21:31,171 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:21:31,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:21:31,172 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:21:31,172 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:21:31,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:21:31,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:21:31,172 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:21:31,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:21:31,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:21:31,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:21:31,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:21:31,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:21:31,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:21:31,175 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:21:31,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:21:31,175 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-03 18:21:31,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:21:31,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:21:31,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:21:31,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:21:31,405 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:21:31,406 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-03 18:21:31,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad750c6/c3ef4bc0fc5543f09a2c67a5cb4a2131/FLAG774590a28 [2022-03-03 18:21:31,856 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:21:31,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-03 18:21:31,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad750c6/c3ef4bc0fc5543f09a2c67a5cb4a2131/FLAG774590a28 [2022-03-03 18:21:31,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad750c6/c3ef4bc0fc5543f09a2c67a5cb4a2131 [2022-03-03 18:21:31,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:21:31,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:21:31,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:21:31,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:21:31,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:21:31,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:21:31" (1/1) ... [2022-03-03 18:21:31,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbf9638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:31, skipping insertion in model container [2022-03-03 18:21:31,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:21:31" (1/1) ... [2022-03-03 18:21:31,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:21:31,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:21:32,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:21:32,280 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:21:32,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:21:32,349 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:21:32,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32 WrapperNode [2022-03-03 18:21:32,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:21:32,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:21:32,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:21:32,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:21:32,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,381 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-03-03 18:21:32,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:21:32,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:21:32,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:21:32,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:21:32,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:21:32,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:21:32,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:21:32,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:21:32,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (1/1) ... [2022-03-03 18:21:32,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:21:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:32,437 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-03 18:21:32,438 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-03 18:21:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:21:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:21:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:21:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:21:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:21:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:21:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:21:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:21:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:21:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:21:32,464 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 18:21:32,546 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:21:32,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:21:32,753 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:21:32,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:21:32,758 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 18:21:32,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:21:32 BoogieIcfgContainer [2022-03-03 18:21:32,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:21:32,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:21:32,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:21:32,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:21:32,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:21:31" (1/3) ... [2022-03-03 18:21:32,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbf712c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:21:32, skipping insertion in model container [2022-03-03 18:21:32,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:32" (2/3) ... [2022-03-03 18:21:32,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbf712c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:21:32, skipping insertion in model container [2022-03-03 18:21:32,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:21:32" (3/3) ... [2022-03-03 18:21:32,781 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-03-03 18:21:32,784 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:21:32,784 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:21:32,784 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-03 18:21:32,785 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:21:32,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,821 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-03 18:21:32,821 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-03 18:21:32,821 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,821 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-03 18:21:32,821 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,822 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,823 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,824 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-03 18:21:32,825 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-03 18:21:32,825 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-03 18:21:32,825 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-03 18:21:32,825 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-03 18:21:32,825 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-03 18:21:32,825 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-03 18:21:32,825 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,826 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-03 18:21:32,827 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-03 18:21:32,827 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-03 18:21:32,827 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-03 18:21:32,827 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-03 18:21:32,827 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-03 18:21:32,827 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-03 18:21:32,828 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-03 18:21:32,828 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-03 18:21:32,828 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-03 18:21:32,828 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-03 18:21:32,828 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-03 18:21:32,828 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-03 18:21:32,829 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-03 18:21:32,829 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-03 18:21:32,829 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-03 18:21:32,829 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-03 18:21:32,830 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-03 18:21:32,830 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-03 18:21:32,830 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-03 18:21:32,830 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-03 18:21:32,830 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-03 18:21:32,830 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-03 18:21:32,831 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-03 18:21:32,831 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-03 18:21:32,831 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-03 18:21:32,834 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-03 18:21:32,835 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-03 18:21:32,835 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-03 18:21:32,837 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-03 18:21:32,838 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-03 18:21:32,839 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-03 18:21:32,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,843 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-03 18:21:32,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,843 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,844 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-03 18:21:32,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,844 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-03 18:21:32,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,844 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-03 18:21:32,844 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,845 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-03 18:21:32,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,846 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-03 18:21:32,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,846 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-03 18:21:32,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,848 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-03 18:21:32,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,849 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-03 18:21:32,849 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,853 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-03 18:21:32,853 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-03 18:21:32,853 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-03 18:21:32,853 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-03 18:21:32,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,865 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-03 18:21:32,865 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-03 18:21:32,866 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-03 18:21:32,866 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-03 18:21:32,866 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-03 18:21:32,866 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-03 18:21:32,866 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-03 18:21:32,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:32,867 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-03 18:21:32,869 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 18:21:32,905 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:21:32,911 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-03 18:21:32,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-03 18:21:32,923 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 106 transitions, 217 flow [2022-03-03 18:21:33,006 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-03 18:21:33,010 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-03 18:21:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-03 18:21:33,021 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:33,021 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-03 18:21:33,022 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-03 18:21:33,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1089390899, now seen corresponding path program 1 times [2022-03-03 18:21:33,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:33,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572647820] [2022-03-03 18:21:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:33,198 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-03 18:21:33,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:33,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572647820] [2022-03-03 18:21:33,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572647820] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:33,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:33,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:21:33,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419394767] [2022-03-03 18:21:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:33,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 18:21:33,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 18:21:33,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 18:21:33,229 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-03 18:21:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:33,266 INFO L93 Difference]: Finished difference Result 1519 states and 3016 transitions. [2022-03-03 18:21:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 18:21:33,268 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-03 18:21:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:33,286 INFO L225 Difference]: With dead ends: 1519 [2022-03-03 18:21:33,286 INFO L226 Difference]: Without dead ends: 1519 [2022-03-03 18:21:33,287 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-03 18:21:33,290 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-03 18:21:33,291 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-03 18:21:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-03-03 18:21:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2022-03-03 18:21:33,380 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-03 18:21:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3016 transitions. [2022-03-03 18:21:33,385 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3016 transitions. Word has length 35 [2022-03-03 18:21:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:33,385 INFO L470 AbstractCegarLoop]: Abstraction has 1519 states and 3016 transitions. [2022-03-03 18:21:33,385 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-03 18:21:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3016 transitions. [2022-03-03 18:21:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-03 18:21:33,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:33,387 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-03 18:21:33,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:21:33,388 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-03 18:21:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1960811916, now seen corresponding path program 1 times [2022-03-03 18:21:33,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:33,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400379034] [2022-03-03 18:21:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:33,439 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-03 18:21:33,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:33,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400379034] [2022-03-03 18:21:33,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400379034] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:33,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:33,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 18:21:33,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239423964] [2022-03-03 18:21:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:33,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:33,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:33,441 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-03 18:21:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:33,465 INFO L93 Difference]: Finished difference Result 1523 states and 3020 transitions. [2022-03-03 18:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:33,466 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-03 18:21:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:33,471 INFO L225 Difference]: With dead ends: 1523 [2022-03-03 18:21:33,471 INFO L226 Difference]: Without dead ends: 1523 [2022-03-03 18:21:33,472 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-03 18:21:33,472 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-03 18:21:33,474 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-03 18:21:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-03-03 18:21:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2022-03-03 18:21:33,524 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-03 18:21:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3017 transitions. [2022-03-03 18:21:33,529 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3017 transitions. Word has length 35 [2022-03-03 18:21:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:33,529 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 3017 transitions. [2022-03-03 18:21:33,529 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-03 18:21:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3017 transitions. [2022-03-03 18:21:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 18:21:33,535 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:33,535 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-03 18:21:33,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:21:33,535 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-03 18:21:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2113524451, now seen corresponding path program 1 times [2022-03-03 18:21:33,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:33,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295831782] [2022-03-03 18:21:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:33,645 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-03 18:21:33,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:33,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295831782] [2022-03-03 18:21:33,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295831782] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:33,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660253992] [2022-03-03 18:21:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:33,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:33,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:33,658 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-03 18:21:33,659 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-03 18:21:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:33,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:21:33,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:33,864 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-03 18:21:33,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:33,973 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-03 18:21:33,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660253992] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:33,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:33,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:21:33,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409887338] [2022-03-03 18:21:33,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:33,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:33,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:33,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:21:33,975 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-03 18:21:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:34,051 INFO L93 Difference]: Finished difference Result 1530 states and 3027 transitions. [2022-03-03 18:21:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:21:34,051 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-03 18:21:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:34,061 INFO L225 Difference]: With dead ends: 1530 [2022-03-03 18:21:34,061 INFO L226 Difference]: Without dead ends: 1530 [2022-03-03 18:21:34,062 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-03 18:21:34,064 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-03 18:21:34,066 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-03 18:21:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-03-03 18:21:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-03-03 18:21:34,091 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-03 18:21:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3027 transitions. [2022-03-03 18:21:34,097 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3027 transitions. Word has length 40 [2022-03-03 18:21:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:34,097 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 3027 transitions. [2022-03-03 18:21:34,097 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-03 18:21:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3027 transitions. [2022-03-03 18:21:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-03 18:21:34,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:34,099 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-03 18:21:34,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:34,307 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-03 18:21:34,308 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-03 18:21:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash 37547901, now seen corresponding path program 2 times [2022-03-03 18:21:34,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:34,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075201922] [2022-03-03 18:21:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:34,382 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-03 18:21:34,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:34,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075201922] [2022-03-03 18:21:34,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075201922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:34,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292993114] [2022-03-03 18:21:34,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:34,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:34,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:34,396 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-03 18:21:34,397 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-03 18:21:34,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:34,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:34,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-03 18:21:34,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:34,541 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-03 18:21:34,566 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-03 18:21:34,567 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-03 18:21:34,600 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-03 18:21:34,601 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-03 18:21:34,652 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:21:34,653 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-03 18:21:34,670 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-03 18:21:34,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:34,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292993114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:34,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:34,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-03 18:21:34,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145599603] [2022-03-03 18:21:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:34,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:34,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-03 18:21:34,672 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-03 18:21:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:34,838 INFO L93 Difference]: Finished difference Result 1831 states and 3629 transitions. [2022-03-03 18:21:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:34,839 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-03 18:21:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:34,844 INFO L225 Difference]: With dead ends: 1831 [2022-03-03 18:21:34,844 INFO L226 Difference]: Without dead ends: 1831 [2022-03-03 18:21:34,845 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-03 18:21:34,845 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-03 18:21:34,845 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-03 18:21:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-03-03 18:21:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1679. [2022-03-03 18:21:34,868 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-03 18:21:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3325 transitions. [2022-03-03 18:21:34,872 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3325 transitions. Word has length 50 [2022-03-03 18:21:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:34,872 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3325 transitions. [2022-03-03 18:21:34,872 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-03 18:21:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3325 transitions. [2022-03-03 18:21:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-03 18:21:34,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:34,873 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-03 18:21:34,892 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-03 18:21:35,087 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-03 18:21:35,088 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-03 18:21:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1921653659, now seen corresponding path program 1 times [2022-03-03 18:21:35,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:35,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867076715] [2022-03-03 18:21:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:35,181 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-03 18:21:35,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:35,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867076715] [2022-03-03 18:21:35,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867076715] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:35,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637566189] [2022-03-03 18:21:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:35,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:35,183 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-03 18:21:35,195 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-03 18:21:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:35,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 18:21:35,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:35,382 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-03 18:21:35,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:35,505 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-03 18:21:35,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637566189] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:35,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:35,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 18:21:35,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074364613] [2022-03-03 18:21:35,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:35,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 18:21:35,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 18:21:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:35,506 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-03 18:21:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:35,643 INFO L93 Difference]: Finished difference Result 1699 states and 3345 transitions. [2022-03-03 18:21:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:21:35,643 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-03 18:21:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:35,648 INFO L225 Difference]: With dead ends: 1699 [2022-03-03 18:21:35,648 INFO L226 Difference]: Without dead ends: 1699 [2022-03-03 18:21:35,649 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-03 18:21:35,649 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-03 18:21:35,650 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-03 18:21:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-03-03 18:21:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2022-03-03 18:21:35,671 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-03 18:21:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3345 transitions. [2022-03-03 18:21:35,675 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3345 transitions. Word has length 50 [2022-03-03 18:21:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:35,675 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 3345 transitions. [2022-03-03 18:21:35,675 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-03 18:21:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3345 transitions. [2022-03-03 18:21:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-03 18:21:35,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:35,676 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-03 18:21:35,707 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-03 18:21:35,887 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-03 18:21:35,888 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-03 18:21:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1189660581, now seen corresponding path program 2 times [2022-03-03 18:21:35,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:35,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063120775] [2022-03-03 18:21:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:36,028 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-03 18:21:36,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:36,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063120775] [2022-03-03 18:21:36,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063120775] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:36,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374382214] [2022-03-03 18:21:36,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:36,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:36,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:36,032 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-03 18:21:36,044 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-03 18:21:36,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:36,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:36,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-03 18:21:36,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:36,255 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-03 18:21:36,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,281 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-03 18:21:36,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,315 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:21:36,315 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-03 18:21:36,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:36,364 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:21:36,364 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-03 18:21:36,391 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-03 18:21:36,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:36,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374382214] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:36,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:36,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-03 18:21:36,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702860431] [2022-03-03 18:21:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:36,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:36,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:21:36,392 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-03 18:21:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:36,738 INFO L93 Difference]: Finished difference Result 3571 states and 7089 transitions. [2022-03-03 18:21:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:21:36,739 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-03 18:21:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:36,750 INFO L225 Difference]: With dead ends: 3571 [2022-03-03 18:21:36,750 INFO L226 Difference]: Without dead ends: 3571 [2022-03-03 18:21:36,751 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-03 18:21:36,752 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-03 18:21:36,752 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-03 18:21:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-03-03 18:21:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2167. [2022-03-03 18:21:36,807 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-03 18:21:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4281 transitions. [2022-03-03 18:21:36,812 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4281 transitions. Word has length 70 [2022-03-03 18:21:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:36,814 INFO L470 AbstractCegarLoop]: Abstraction has 2167 states and 4281 transitions. [2022-03-03 18:21:36,814 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-03 18:21:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4281 transitions. [2022-03-03 18:21:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-03 18:21:36,815 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:36,815 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-03 18:21:36,832 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-03 18:21:37,027 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-03 18:21:37,027 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-03 18:21:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1998481730, now seen corresponding path program 1 times [2022-03-03 18:21:37,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:37,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994899854] [2022-03-03 18:21:37,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,188 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-03 18:21:37,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:37,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994899854] [2022-03-03 18:21:37,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994899854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:37,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938145239] [2022-03-03 18:21:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:37,189 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-03 18:21:37,190 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-03 18:21:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 18:21:37,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:37,392 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-03 18:21:37,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:37,555 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-03 18:21:37,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938145239] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:37,556 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:37,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-03 18:21:37,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954053991] [2022-03-03 18:21:37,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:37,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-03 18:21:37,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-03 18:21:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:37,557 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-03 18:21:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:37,760 INFO L93 Difference]: Finished difference Result 2182 states and 4296 transitions. [2022-03-03 18:21:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:21:37,761 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-03 18:21:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:37,767 INFO L225 Difference]: With dead ends: 2182 [2022-03-03 18:21:37,767 INFO L226 Difference]: Without dead ends: 2182 [2022-03-03 18:21:37,768 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-03 18:21:37,769 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-03 18:21:37,769 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-03 18:21:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2022-03-03 18:21:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2022-03-03 18:21:37,796 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-03 18:21:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 4296 transitions. [2022-03-03 18:21:37,800 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 4296 transitions. Word has length 78 [2022-03-03 18:21:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:37,800 INFO L470 AbstractCegarLoop]: Abstraction has 2182 states and 4296 transitions. [2022-03-03 18:21:37,800 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-03 18:21:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 4296 transitions. [2022-03-03 18:21:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-03 18:21:37,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:37,801 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-03 18:21:37,826 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-03 18:21:38,014 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-03 18:21:38,017 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-03 18:21:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 920350873, now seen corresponding path program 2 times [2022-03-03 18:21:38,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:38,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911432658] [2022-03-03 18:21:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,111 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-03 18:21:38,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:38,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911432658] [2022-03-03 18:21:38,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911432658] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:38,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:38,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:38,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246288846] [2022-03-03 18:21:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:38,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:38,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:38,112 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-03 18:21:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:38,223 INFO L93 Difference]: Finished difference Result 2448 states and 4828 transitions. [2022-03-03 18:21:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:38,227 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-03 18:21:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:38,233 INFO L225 Difference]: With dead ends: 2448 [2022-03-03 18:21:38,233 INFO L226 Difference]: Without dead ends: 2203 [2022-03-03 18:21:38,234 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-03 18:21:38,234 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-03 18:21:38,234 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-03 18:21:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-03-03 18:21:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2098. [2022-03-03 18:21:38,258 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-03 18:21:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4114 transitions. [2022-03-03 18:21:38,261 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4114 transitions. Word has length 93 [2022-03-03 18:21:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:38,262 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 4114 transitions. [2022-03-03 18:21:38,262 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-03 18:21:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4114 transitions. [2022-03-03 18:21:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-03 18:21:38,263 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:38,263 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-03 18:21:38,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 18:21:38,263 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-03 18:21:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1018614855, now seen corresponding path program 1 times [2022-03-03 18:21:38,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:38,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021477432] [2022-03-03 18:21:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,342 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-03 18:21:38,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:38,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021477432] [2022-03-03 18:21:38,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021477432] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:38,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:38,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:38,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361970344] [2022-03-03 18:21:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:38,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:38,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:38,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:38,344 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-03 18:21:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:38,473 INFO L93 Difference]: Finished difference Result 2349 states and 4616 transitions. [2022-03-03 18:21:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:38,473 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-03 18:21:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:38,480 INFO L225 Difference]: With dead ends: 2349 [2022-03-03 18:21:38,480 INFO L226 Difference]: Without dead ends: 2349 [2022-03-03 18:21:38,480 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-03 18:21:38,481 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-03 18:21:38,481 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-03 18:21:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-03-03 18:21:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2229. [2022-03-03 18:21:38,511 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-03 18:21:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4376 transitions. [2022-03-03 18:21:38,516 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4376 transitions. Word has length 93 [2022-03-03 18:21:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:38,516 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 4376 transitions. [2022-03-03 18:21:38,516 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-03 18:21:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4376 transitions. [2022-03-03 18:21:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:38,518 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:38,518 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-03 18:21:38,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 18:21:38,518 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-03 18:21:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1317609396, now seen corresponding path program 1 times [2022-03-03 18:21:38,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:38,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69836890] [2022-03-03 18:21:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,682 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-03 18:21:38,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:38,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69836890] [2022-03-03 18:21:38,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69836890] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:38,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060819929] [2022-03-03 18:21:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:38,684 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-03 18:21:38,685 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-03 18:21:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:38,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:38,968 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-03 18:21:39,035 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-03 18:21:39,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:39,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060819929] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:39,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:39,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:39,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226258460] [2022-03-03 18:21:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:39,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:39,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:39,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:39,036 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-03 18:21:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:39,479 INFO L93 Difference]: Finished difference Result 6535 states and 12955 transitions. [2022-03-03 18:21:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:21:39,479 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-03 18:21:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:39,502 INFO L225 Difference]: With dead ends: 6535 [2022-03-03 18:21:39,502 INFO L226 Difference]: Without dead ends: 6535 [2022-03-03 18:21:39,503 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-03 18:21:39,503 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-03 18:21:39,504 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-03 18:21:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-03-03 18:21:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 2407. [2022-03-03 18:21:39,580 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-03 18:21:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4713 transitions. [2022-03-03 18:21:39,585 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4713 transitions. Word has length 105 [2022-03-03 18:21:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:39,585 INFO L470 AbstractCegarLoop]: Abstraction has 2407 states and 4713 transitions. [2022-03-03 18:21:39,585 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-03 18:21:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4713 transitions. [2022-03-03 18:21:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:39,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:39,587 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-03 18:21:39,612 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-03 18:21:39,799 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-03 18:21:39,799 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-03 18:21:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1330543596, now seen corresponding path program 2 times [2022-03-03 18:21:39,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:39,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876072292] [2022-03-03 18:21:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:39,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:39,946 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-03 18:21:39,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:39,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876072292] [2022-03-03 18:21:39,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876072292] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:39,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165121650] [2022-03-03 18:21:39,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:39,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:39,947 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-03 18:21:39,949 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-03 18:21:40,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:40,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:40,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:40,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:40,296 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-03 18:21:40,364 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-03 18:21:40,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:40,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165121650] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:40,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:40,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:40,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109471011] [2022-03-03 18:21:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:40,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:40,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:40,365 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-03 18:21:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:41,280 INFO L93 Difference]: Finished difference Result 5977 states and 11801 transitions. [2022-03-03 18:21:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:21:41,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-03 18:21:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:41,291 INFO L225 Difference]: With dead ends: 5977 [2022-03-03 18:21:41,291 INFO L226 Difference]: Without dead ends: 5977 [2022-03-03 18:21:41,292 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-03 18:21:41,292 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:41,292 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.4s Time] [2022-03-03 18:21:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2022-03-03 18:21:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 2486. [2022-03-03 18:21:41,342 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-03 18:21:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4852 transitions. [2022-03-03 18:21:41,346 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4852 transitions. Word has length 105 [2022-03-03 18:21:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:41,346 INFO L470 AbstractCegarLoop]: Abstraction has 2486 states and 4852 transitions. [2022-03-03 18:21:41,346 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-03 18:21:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4852 transitions. [2022-03-03 18:21:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:41,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:41,348 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-03 18:21:41,365 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-03 18:21:41,565 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-03 18:21:41,565 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-03 18:21:41,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash -103262266, now seen corresponding path program 3 times [2022-03-03 18:21:41,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:41,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735235642] [2022-03-03 18:21:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:41,683 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-03 18:21:41,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:41,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735235642] [2022-03-03 18:21:41,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735235642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:41,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469425875] [2022-03-03 18:21:41,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:21:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:41,687 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-03 18:21:41,689 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-03 18:21:41,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:21:41,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:41,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:41,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:41,950 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-03 18:21:42,039 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-03 18:21:42,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:42,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469425875] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:42,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:42,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:42,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141873396] [2022-03-03 18:21:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:42,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:42,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:42,041 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-03 18:21:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:42,440 INFO L93 Difference]: Finished difference Result 6280 states and 12407 transitions. [2022-03-03 18:21:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:21:42,440 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-03 18:21:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:42,450 INFO L225 Difference]: With dead ends: 6280 [2022-03-03 18:21:42,450 INFO L226 Difference]: Without dead ends: 6280 [2022-03-03 18:21:42,450 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-03 18:21:42,451 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-03 18:21:42,451 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-03 18:21:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2022-03-03 18:21:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 2495. [2022-03-03 18:21:42,496 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-03 18:21:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4870 transitions. [2022-03-03 18:21:42,499 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4870 transitions. Word has length 105 [2022-03-03 18:21:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:42,499 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4870 transitions. [2022-03-03 18:21:42,500 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-03 18:21:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4870 transitions. [2022-03-03 18:21:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:42,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:42,501 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-03 18:21:42,520 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-03 18:21:42,715 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-03 18:21:42,716 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-03 18:21:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1750076570, now seen corresponding path program 4 times [2022-03-03 18:21:42,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:42,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803585975] [2022-03-03 18:21:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:43,075 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-03 18:21:43,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:43,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803585975] [2022-03-03 18:21:43,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803585975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:43,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50499695] [2022-03-03 18:21:43,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:21:43,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:43,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:43,076 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-03 18:21:43,077 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-03 18:21:43,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:21:43,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:43,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-03 18:21:43,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:43,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:43,565 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-03 18:21:43,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:43,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50499695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:43,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:43,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:43,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001833390] [2022-03-03 18:21:43,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:43,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:43,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:43,567 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-03 18:21:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:44,488 INFO L93 Difference]: Finished difference Result 7583 states and 14975 transitions. [2022-03-03 18:21:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:21:44,491 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-03 18:21:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:44,505 INFO L225 Difference]: With dead ends: 7583 [2022-03-03 18:21:44,505 INFO L226 Difference]: Without dead ends: 7583 [2022-03-03 18:21:44,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2022-03-03 18:21:44,506 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-03 18:21:44,506 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-03 18:21:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-03-03 18:21:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 2492. [2022-03-03 18:21:44,560 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-03 18:21:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4864 transitions. [2022-03-03 18:21:44,565 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4864 transitions. Word has length 105 [2022-03-03 18:21:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:44,565 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 4864 transitions. [2022-03-03 18:21:44,565 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-03 18:21:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4864 transitions. [2022-03-03 18:21:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:44,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:44,567 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-03 18:21:44,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:44,780 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-03 18:21:44,780 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-03 18:21:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 412316490, now seen corresponding path program 5 times [2022-03-03 18:21:44,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:44,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697063956] [2022-03-03 18:21:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:45,129 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-03 18:21:45,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:45,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697063956] [2022-03-03 18:21:45,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697063956] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:45,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500992229] [2022-03-03 18:21:45,130 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:21:45,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:45,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:45,131 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-03 18:21:45,137 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-03 18:21:45,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:21:45,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:45,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:45,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:45,530 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-03 18:21:45,602 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-03 18:21:45,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:45,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500992229] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:45,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:45,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:45,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102396625] [2022-03-03 18:21:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:45,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:45,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:45,606 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-03 18:21:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:46,568 INFO L93 Difference]: Finished difference Result 7733 states and 15280 transitions. [2022-03-03 18:21:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 18:21:46,569 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-03 18:21:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:46,579 INFO L225 Difference]: With dead ends: 7733 [2022-03-03 18:21:46,580 INFO L226 Difference]: Without dead ends: 7733 [2022-03-03 18:21:46,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=411, Invalid=2345, Unknown=0, NotChecked=0, Total=2756 [2022-03-03 18:21:46,581 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:46,581 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.3s Time] [2022-03-03 18:21:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2022-03-03 18:21:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 2496. [2022-03-03 18:21:46,634 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-03 18:21:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4872 transitions. [2022-03-03 18:21:46,638 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4872 transitions. Word has length 105 [2022-03-03 18:21:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:46,638 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 4872 transitions. [2022-03-03 18:21:46,638 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-03 18:21:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4872 transitions. [2022-03-03 18:21:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:46,640 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:46,640 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-03 18:21:46,661 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-03 18:21:46,862 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-03 18:21:46,862 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-03 18:21:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -155675980, now seen corresponding path program 6 times [2022-03-03 18:21:46,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:46,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295413519] [2022-03-03 18:21:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:47,013 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-03 18:21:47,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:47,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295413519] [2022-03-03 18:21:47,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295413519] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:47,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579910574] [2022-03-03 18:21:47,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:21:47,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:47,015 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-03 18:21:47,016 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-03 18:21:47,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:21:47,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:47,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:47,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:47,369 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-03 18:21:47,466 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-03 18:21:47,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:47,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579910574] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:47,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:47,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:47,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974741217] [2022-03-03 18:21:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:47,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:47,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:47,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:47,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:47,467 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-03 18:21:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:47,974 INFO L93 Difference]: Finished difference Result 6177 states and 12187 transitions. [2022-03-03 18:21:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:21:47,974 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-03 18:21:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:47,981 INFO L225 Difference]: With dead ends: 6177 [2022-03-03 18:21:47,981 INFO L226 Difference]: Without dead ends: 6177 [2022-03-03 18:21:47,981 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-03 18:21:47,982 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-03 18:21:47,982 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-03 18:21:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2022-03-03 18:21:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 2536. [2022-03-03 18:21:48,032 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-03 18:21:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-03-03 18:21:48,037 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-03-03 18:21:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:48,037 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-03-03 18:21:48,037 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-03 18:21:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-03-03 18:21:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:48,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:48,041 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-03 18:21:48,067 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-03 18:21:48,247 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-03 18:21:48,247 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-03 18:21:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1295126466, now seen corresponding path program 7 times [2022-03-03 18:21:48,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:48,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891233223] [2022-03-03 18:21:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:48,374 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-03 18:21:48,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:48,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891233223] [2022-03-03 18:21:48,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891233223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:48,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839032680] [2022-03-03 18:21:48,374 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:21:48,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:48,376 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-03 18:21:48,420 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-03 18:21:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:48,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:48,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:48,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:48,835 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-03 18:21:48,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:48,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839032680] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:48,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:48,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:48,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103039121] [2022-03-03 18:21:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:48,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:48,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:48,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:48,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:48,836 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-03 18:21:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:49,689 INFO L93 Difference]: Finished difference Result 6219 states and 12247 transitions. [2022-03-03 18:21:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:21:49,690 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-03 18:21:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:49,697 INFO L225 Difference]: With dead ends: 6219 [2022-03-03 18:21:49,697 INFO L226 Difference]: Without dead ends: 6219 [2022-03-03 18:21:49,697 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-03 18:21:49,697 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-03 18:21:49,698 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-03 18:21:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2022-03-03 18:21:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 2536. [2022-03-03 18:21:49,739 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-03 18:21:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-03-03 18:21:49,742 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-03-03 18:21:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:49,742 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-03-03 18:21:49,742 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-03 18:21:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-03-03 18:21:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:49,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:49,744 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-03 18:21:49,769 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-03 18:21:49,963 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-03 18:21:49,963 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-03 18:21:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2095944408, now seen corresponding path program 8 times [2022-03-03 18:21:49,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:49,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484791677] [2022-03-03 18:21:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:50,228 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-03 18:21:50,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:50,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484791677] [2022-03-03 18:21:50,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484791677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:50,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761388567] [2022-03-03 18:21:50,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:50,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:50,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:50,229 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-03 18:21:50,230 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-03 18:21:50,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:50,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:50,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:50,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:50,541 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-03 18:21:50,643 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-03 18:21:50,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:50,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761388567] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:50,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:50,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:50,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835838986] [2022-03-03 18:21:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:50,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:50,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:50,646 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-03 18:21:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:51,020 INFO L93 Difference]: Finished difference Result 5867 states and 11581 transitions. [2022-03-03 18:21:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:21:51,021 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-03 18:21:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:51,027 INFO L225 Difference]: With dead ends: 5867 [2022-03-03 18:21:51,027 INFO L226 Difference]: Without dead ends: 5867 [2022-03-03 18:21:51,028 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-03 18:21:51,028 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:51,028 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.3s Time] [2022-03-03 18:21:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2022-03-03 18:21:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 2554. [2022-03-03 18:21:51,072 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-03 18:21:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-03-03 18:21:51,077 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-03-03 18:21:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:51,078 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-03-03 18:21:51,078 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-03 18:21:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-03-03 18:21:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:51,080 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:51,080 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-03 18:21:51,107 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-03 18:21:51,307 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-03 18:21:51,308 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-03 18:21:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 552208584, now seen corresponding path program 9 times [2022-03-03 18:21:51,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:51,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987808464] [2022-03-03 18:21:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:51,542 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-03 18:21:51,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:51,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987808464] [2022-03-03 18:21:51,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987808464] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:51,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493310562] [2022-03-03 18:21:51,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:21:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:51,544 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-03 18:21:51,557 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-03 18:21:51,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:21:51,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:51,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:51,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:51,926 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-03 18:21:51,989 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-03 18:21:51,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:51,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493310562] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:51,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:51,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:21:51,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161751140] [2022-03-03 18:21:51,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:51,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:51,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:21:51,991 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-03 18:21:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:52,839 INFO L93 Difference]: Finished difference Result 7170 states and 14149 transitions. [2022-03-03 18:21:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:21:52,839 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-03 18:21:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:52,858 INFO L225 Difference]: With dead ends: 7170 [2022-03-03 18:21:52,859 INFO L226 Difference]: Without dead ends: 7170 [2022-03-03 18:21:52,859 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-03 18:21:52,859 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-03 18:21:52,860 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-03 18:21:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2022-03-03 18:21:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 2551. [2022-03-03 18:21:52,916 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-03 18:21:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-03-03 18:21:52,919 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-03-03 18:21:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:52,919 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-03-03 18:21:52,920 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-03 18:21:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-03-03 18:21:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:52,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:52,922 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-03 18:21:52,941 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-03 18:21:53,139 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-03 18:21:53,139 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-03 18:21:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1580365652, now seen corresponding path program 10 times [2022-03-03 18:21:53,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:53,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310396255] [2022-03-03 18:21:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:53,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:53,255 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-03 18:21:53,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:53,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310396255] [2022-03-03 18:21:53,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310396255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:53,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675147713] [2022-03-03 18:21:53,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:21:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:53,257 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-03 18:21:53,258 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-03 18:21:53,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:21:53,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:53,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:21:53,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:53,609 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-03 18:21:53,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-03 18:21:53,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:53,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675147713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:53,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:53,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-03 18:21:53,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657546845] [2022-03-03 18:21:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:53,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:21:53,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:53,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:21:53,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:21:53,647 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-03 18:21:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:54,458 INFO L93 Difference]: Finished difference Result 9974 states and 19724 transitions. [2022-03-03 18:21:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-03 18:21:54,459 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-03 18:21:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:54,470 INFO L225 Difference]: With dead ends: 9974 [2022-03-03 18:21:54,470 INFO L226 Difference]: Without dead ends: 9974 [2022-03-03 18:21:54,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:21:54,471 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:54,471 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.4s Time] [2022-03-03 18:21:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2022-03-03 18:21:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 2555. [2022-03-03 18:21:54,528 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-03 18:21:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-03-03 18:21:54,531 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-03-03 18:21:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:54,531 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-03-03 18:21:54,531 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-03 18:21:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-03-03 18:21:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:54,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:54,533 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-03 18:21:54,561 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-03 18:21:54,759 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-03 18:21:54,759 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-03 18:21:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2146609174, now seen corresponding path program 11 times [2022-03-03 18:21:54,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:54,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497032542] [2022-03-03 18:21:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:55,045 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-03 18:21:55,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:55,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497032542] [2022-03-03 18:21:55,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497032542] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:55,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433881342] [2022-03-03 18:21:55,045 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:21:55,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:55,046 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-03 18:21:55,048 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-03 18:21:55,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:21:55,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:55,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:55,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:55,431 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-03 18:21:55,517 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-03 18:21:55,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:55,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433881342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:55,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:55,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:55,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216097523] [2022-03-03 18:21:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:55,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:55,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:55,520 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-03 18:21:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:56,041 INFO L93 Difference]: Finished difference Result 7437 states and 14669 transitions. [2022-03-03 18:21:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:21:56,041 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-03 18:21:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:56,050 INFO L225 Difference]: With dead ends: 7437 [2022-03-03 18:21:56,050 INFO L226 Difference]: Without dead ends: 7437 [2022-03-03 18:21:56,050 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-03 18:21:56,051 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:56,051 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.3s Time] [2022-03-03 18:21:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2022-03-03 18:21:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 2557. [2022-03-03 18:21:56,099 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-03 18:21:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-03-03 18:21:56,103 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-03-03 18:21:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:56,103 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-03-03 18:21:56,103 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-03 18:21:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-03-03 18:21:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:56,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:56,105 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-03 18:21:56,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-03 18:21:56,315 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-03 18:21:56,315 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-03 18:21:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:56,316 INFO L85 PathProgramCache]: Analyzing trace with hash -697555676, now seen corresponding path program 12 times [2022-03-03 18:21:56,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:56,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389442716] [2022-03-03 18:21:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:56,586 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-03 18:21:56,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:56,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389442716] [2022-03-03 18:21:56,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389442716] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:56,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810763234] [2022-03-03 18:21:56,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:21:56,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:56,599 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-03 18:21:56,600 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-03 18:21:56,712 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:21:56,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:56,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:56,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:57,023 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-03 18:21:57,095 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-03 18:21:57,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:57,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810763234] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:57,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:57,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:57,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239563260] [2022-03-03 18:21:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:57,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:57,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:57,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:57,096 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-03 18:21:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:57,954 INFO L93 Difference]: Finished difference Result 7479 states and 14729 transitions. [2022-03-03 18:21:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:21:57,955 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-03 18:21:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:57,964 INFO L225 Difference]: With dead ends: 7479 [2022-03-03 18:21:57,964 INFO L226 Difference]: Without dead ends: 7479 [2022-03-03 18:21:57,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 18:21:57,965 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-03 18:21:57,965 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-03 18:21:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2022-03-03 18:21:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 2545. [2022-03-03 18:21:58,013 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-03 18:21:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4970 transitions. [2022-03-03 18:21:58,016 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4970 transitions. Word has length 105 [2022-03-03 18:21:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:58,017 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 4970 transitions. [2022-03-03 18:21:58,017 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-03 18:21:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4970 transitions. [2022-03-03 18:21:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:58,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:58,019 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-03 18:21:58,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:58,236 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-03 18:21:58,237 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-03 18:21:58,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash 703468234, now seen corresponding path program 13 times [2022-03-03 18:21:58,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:58,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936102385] [2022-03-03 18:21:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:58,561 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-03 18:21:58,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:58,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936102385] [2022-03-03 18:21:58,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936102385] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:58,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025167246] [2022-03-03 18:21:58,562 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:21:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:58,563 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-03 18:21:58,563 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-03 18:21:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:58,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:58,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:58,975 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-03 18:21:59,046 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-03 18:21:59,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:59,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025167246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:59,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:59,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:59,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609067784] [2022-03-03 18:21:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:59,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:59,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:59,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:59,048 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-03 18:21:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:59,862 INFO L93 Difference]: Finished difference Result 7306 states and 14426 transitions. [2022-03-03 18:21:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:21:59,862 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-03 18:21:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:59,872 INFO L225 Difference]: With dead ends: 7306 [2022-03-03 18:21:59,872 INFO L226 Difference]: Without dead ends: 7306 [2022-03-03 18:21:59,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2022-03-03 18:21:59,873 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-03 18:21:59,873 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-03 18:21:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-03-03 18:21:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 2555. [2022-03-03 18:21:59,921 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-03 18:21:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-03-03 18:21:59,924 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-03-03 18:21:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:59,924 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-03-03 18:21:59,924 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-03 18:21:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-03-03 18:21:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:59,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:59,926 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-03 18:21:59,945 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-03 18:22:00,131 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-03 18:22:00,131 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-03 18:22:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash 135475764, now seen corresponding path program 14 times [2022-03-03 18:22:00,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:00,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409361999] [2022-03-03 18:22:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:00,405 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-03 18:22:00,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:00,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409361999] [2022-03-03 18:22:00,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409361999] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:00,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517609221] [2022-03-03 18:22:00,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:00,407 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-03 18:22:00,410 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-03 18:22:00,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:00,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:00,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:00,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:00,797 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-03 18:22:00,882 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-03 18:22:00,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:00,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517609221] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:00,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:00,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:00,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216523459] [2022-03-03 18:22:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:00,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:00,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:00,884 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-03 18:22:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:01,396 INFO L93 Difference]: Finished difference Result 7627 states and 15035 transitions. [2022-03-03 18:22:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:22:01,398 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-03 18:22:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:01,407 INFO L225 Difference]: With dead ends: 7627 [2022-03-03 18:22:01,407 INFO L226 Difference]: Without dead ends: 7627 [2022-03-03 18:22:01,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:22:01,408 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-03 18:22:01,408 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-03 18:22:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2022-03-03 18:22:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 2557. [2022-03-03 18:22:01,452 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-03 18:22:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-03-03 18:22:01,455 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-03-03 18:22:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:01,455 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-03-03 18:22:01,455 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-03 18:22:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-03-03 18:22:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:01,458 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:01,458 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-03 18:22:01,478 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-03 18:22:01,671 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-03 18:22:01,672 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-03 18:22:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1586278210, now seen corresponding path program 15 times [2022-03-03 18:22:01,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:01,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974888942] [2022-03-03 18:22:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:01,954 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-03 18:22:01,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:01,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974888942] [2022-03-03 18:22:01,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974888942] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:01,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130096926] [2022-03-03 18:22:01,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:01,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:01,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:01,955 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-03 18:22:01,956 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-03 18:22:02,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:02,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:02,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:02,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:02,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-03 18:22:02,399 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-03 18:22:02,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:02,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130096926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:02,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:02,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:02,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843304435] [2022-03-03 18:22:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:02,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:02,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:02,400 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-03 18:22:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:03,230 INFO L93 Difference]: Finished difference Result 7669 states and 15095 transitions. [2022-03-03 18:22:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:22:03,230 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-03 18:22:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:03,239 INFO L225 Difference]: With dead ends: 7669 [2022-03-03 18:22:03,239 INFO L226 Difference]: Without dead ends: 7669 [2022-03-03 18:22:03,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2022-03-03 18:22:03,240 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-03 18:22:03,240 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-03 18:22:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-03-03 18:22:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 2551. [2022-03-03 18:22:03,281 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-03 18:22:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-03-03 18:22:03,284 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-03-03 18:22:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:03,284 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-03-03 18:22:03,284 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-03 18:22:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-03-03 18:22:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:03,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:03,286 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-03 18:22:03,302 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-03 18:22:03,487 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-03 18:22:03,488 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-03 18:22:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash -27754878, now seen corresponding path program 16 times [2022-03-03 18:22:03,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:03,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075008476] [2022-03-03 18:22:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:03,656 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-03 18:22:03,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:03,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075008476] [2022-03-03 18:22:03,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075008476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:03,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437928926] [2022-03-03 18:22:03,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:03,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:03,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:03,658 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-03 18:22:03,667 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-03 18:22:03,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:03,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:03,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-03 18:22:03,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:04,050 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-03 18:22:04,198 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-03 18:22:04,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,226 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-03 18:22:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,261 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-03 18:22:04,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:04,306 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-03 18:22:04,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:04,348 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-03 18:22:04,356 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-03 18:22:04,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:04,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437928926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:04,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:04,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2022-03-03 18:22:04,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467996814] [2022-03-03 18:22:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:04,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:22:04,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:04,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:22:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:22:04,357 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-03 18:22:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:05,016 INFO L93 Difference]: Finished difference Result 6873 states and 13572 transitions. [2022-03-03 18:22:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:22:05,016 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-03 18:22:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:05,024 INFO L225 Difference]: With dead ends: 6873 [2022-03-03 18:22:05,024 INFO L226 Difference]: Without dead ends: 6873 [2022-03-03 18:22:05,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=922, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:22:05,025 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-03 18:22:05,025 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-03 18:22:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2022-03-03 18:22:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 2556. [2022-03-03 18:22:05,061 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-03 18:22:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4992 transitions. [2022-03-03 18:22:05,064 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4992 transitions. Word has length 105 [2022-03-03 18:22:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:05,064 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 4992 transitions. [2022-03-03 18:22:05,064 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-03 18:22:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4992 transitions. [2022-03-03 18:22:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:05,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:05,066 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-03 18:22:05,083 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-03 18:22:05,282 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-03 18:22:05,283 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-03 18:22:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 782515202, now seen corresponding path program 17 times [2022-03-03 18:22:05,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:05,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066595329] [2022-03-03 18:22:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:05,446 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-03 18:22:05,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:05,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066595329] [2022-03-03 18:22:05,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066595329] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:05,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523271166] [2022-03-03 18:22:05,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:05,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:05,448 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-03 18:22:05,448 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-03 18:22:05,597 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:05,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:05,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:05,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:05,841 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-03 18:22:05,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-03 18:22:05,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:05,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523271166] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:05,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:05,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:05,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31035231] [2022-03-03 18:22:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:05,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:05,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:05,905 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-03 18:22:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:06,672 INFO L93 Difference]: Finished difference Result 7089 states and 13973 transitions. [2022-03-03 18:22:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:22:06,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-03 18:22:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:06,681 INFO L225 Difference]: With dead ends: 7089 [2022-03-03 18:22:06,681 INFO L226 Difference]: Without dead ends: 7089 [2022-03-03 18:22:06,681 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-03 18:22:06,682 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-03 18:22:06,682 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-03 18:22:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-03-03 18:22:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2554. [2022-03-03 18:22:06,722 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-03 18:22:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-03-03 18:22:06,725 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-03-03 18:22:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:06,725 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-03-03 18:22:06,725 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-03 18:22:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-03-03 18:22:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:06,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:06,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-03 18:22:06,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-03 18:22:06,943 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-03 18:22:06,943 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-03 18:22:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -612674444, now seen corresponding path program 18 times [2022-03-03 18:22:06,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:06,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311051663] [2022-03-03 18:22:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:07,298 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-03 18:22:07,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:07,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311051663] [2022-03-03 18:22:07,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311051663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:07,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923225845] [2022-03-03 18:22:07,298 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:07,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:07,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:07,300 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-03 18:22:07,300 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-03 18:22:07,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:07,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:07,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:07,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:07,671 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-03 18:22:07,776 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-03 18:22:07,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:07,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923225845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:07,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:07,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:07,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831816932] [2022-03-03 18:22:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:07,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:07,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:07,777 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-03 18:22:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:08,052 INFO L93 Difference]: Finished difference Result 4622 states and 9091 transitions. [2022-03-03 18:22:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:08,053 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-03 18:22:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:08,058 INFO L225 Difference]: With dead ends: 4622 [2022-03-03 18:22:08,058 INFO L226 Difference]: Without dead ends: 4622 [2022-03-03 18:22:08,058 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-03 18:22:08,058 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-03 18:22:08,059 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-03 18:22:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-03-03 18:22:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2611. [2022-03-03 18:22:08,089 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-03 18:22:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 5102 transitions. [2022-03-03 18:22:08,091 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 5102 transitions. Word has length 105 [2022-03-03 18:22:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:08,092 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 5102 transitions. [2022-03-03 18:22:08,092 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-03 18:22:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 5102 transitions. [2022-03-03 18:22:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:08,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:08,093 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-03 18:22:08,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-03 18:22:08,294 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-03 18:22:08,294 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-03 18:22:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -830929600, now seen corresponding path program 19 times [2022-03-03 18:22:08,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:08,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678369255] [2022-03-03 18:22:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:08,407 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-03 18:22:08,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:08,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678369255] [2022-03-03 18:22:08,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678369255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:08,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646034483] [2022-03-03 18:22:08,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:08,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:08,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:08,409 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-03 18:22:08,410 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-03 18:22:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:08,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:08,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:08,743 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-03 18:22:08,822 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-03 18:22:08,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:08,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646034483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:08,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:08,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:08,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100734144] [2022-03-03 18:22:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:08,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:08,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:08,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:08,824 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-03 18:22:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:09,151 INFO L93 Difference]: Finished difference Result 5142 states and 10145 transitions. [2022-03-03 18:22:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:09,151 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-03 18:22:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:09,156 INFO L225 Difference]: With dead ends: 5142 [2022-03-03 18:22:09,157 INFO L226 Difference]: Without dead ends: 5142 [2022-03-03 18:22:09,157 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-03 18:22:09,157 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 559 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 18:22:09,157 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-03 18:22:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-03-03 18:22:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 2626. [2022-03-03 18:22:09,202 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-03 18:22:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-03-03 18:22:09,205 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-03-03 18:22:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:09,205 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-03-03 18:22:09,205 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-03 18:22:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-03-03 18:22:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:09,207 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:09,207 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-03 18:22:09,226 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-03 18:22:09,412 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-03 18:22:09,412 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-03 18:22:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1817223392, now seen corresponding path program 20 times [2022-03-03 18:22:09,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:09,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037826355] [2022-03-03 18:22:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:09,718 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-03 18:22:09,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:09,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037826355] [2022-03-03 18:22:09,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037826355] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:09,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203913828] [2022-03-03 18:22:09,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:09,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:09,724 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-03 18:22:09,725 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-03 18:22:09,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:09,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:09,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:09,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:10,118 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-03 18:22:10,183 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-03 18:22:10,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:10,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203913828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:10,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:10,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:10,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431033707] [2022-03-03 18:22:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:10,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:10,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:10,184 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-03 18:22:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:10,922 INFO L93 Difference]: Finished difference Result 6445 states and 12713 transitions. [2022-03-03 18:22:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:10,923 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-03 18:22:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:10,930 INFO L225 Difference]: With dead ends: 6445 [2022-03-03 18:22:10,930 INFO L226 Difference]: Without dead ends: 6445 [2022-03-03 18:22:10,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:22:10,931 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 959 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03 18:22:10,931 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-03 18:22:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-03-03 18:22:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 2623. [2022-03-03 18:22:10,979 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-03 18:22:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-03-03 18:22:10,982 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-03-03 18:22:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:10,982 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-03-03 18:22:10,982 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-03 18:22:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-03-03 18:22:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:10,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:10,984 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-03 18:22:11,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-03 18:22:11,184 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-03 18:22:11,185 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-03 18:22:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -315350844, now seen corresponding path program 21 times [2022-03-03 18:22:11,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:11,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124178080] [2022-03-03 18:22:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:11,497 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-03 18:22:11,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:11,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124178080] [2022-03-03 18:22:11,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124178080] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:11,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803109684] [2022-03-03 18:22:11,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:11,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:11,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:11,499 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-03 18:22:11,500 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-03 18:22:11,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:11,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:11,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:11,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:11,909 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-03 18:22:11,985 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-03 18:22:11,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:11,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803109684] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:11,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:11,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:11,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410096615] [2022-03-03 18:22:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:11,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:11,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:11,992 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-03 18:22:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:12,876 INFO L93 Difference]: Finished difference Result 8268 states and 16326 transitions. [2022-03-03 18:22:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:12,877 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-03 18:22:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:12,885 INFO L225 Difference]: With dead ends: 8268 [2022-03-03 18:22:12,885 INFO L226 Difference]: Without dead ends: 8268 [2022-03-03 18:22:12,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=2011, Unknown=0, NotChecked=0, Total=2352 [2022-03-03 18:22:12,886 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:12,886 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.4s Time] [2022-03-03 18:22:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2022-03-03 18:22:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 2627. [2022-03-03 18:22:12,926 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-03 18:22:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-03-03 18:22:12,929 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-03-03 18:22:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:12,929 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-03-03 18:22:12,929 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-03 18:22:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-03-03 18:22:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:12,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:12,931 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-03 18:22:12,947 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-03 18:22:13,143 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-03 18:22:13,143 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-03 18:22:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -883343314, now seen corresponding path program 22 times [2022-03-03 18:22:13,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:13,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610881691] [2022-03-03 18:22:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:13,403 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-03 18:22:13,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:13,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610881691] [2022-03-03 18:22:13,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610881691] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:13,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051501660] [2022-03-03 18:22:13,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:13,405 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-03 18:22:13,424 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-03 18:22:13,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:13,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:13,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:13,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:13,789 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-03 18:22:13,838 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-03 18:22:13,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:13,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051501660] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:13,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:13,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-03-03 18:22:13,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534198589] [2022-03-03 18:22:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:13,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:13,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:13,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:22:13,839 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-03 18:22:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:14,446 INFO L93 Difference]: Finished difference Result 7769 states and 15347 transitions. [2022-03-03 18:22:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:22:14,447 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-03 18:22:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:14,455 INFO L225 Difference]: With dead ends: 7769 [2022-03-03 18:22:14,456 INFO L226 Difference]: Without dead ends: 7769 [2022-03-03 18:22:14,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:22:14,456 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-03 18:22:14,457 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-03 18:22:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7769 states. [2022-03-03 18:22:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7769 to 2629. [2022-03-03 18:22:14,506 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-03 18:22:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-03-03 18:22:14,508 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-03-03 18:22:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:14,509 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-03-03 18:22:14,509 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-03 18:22:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-03-03 18:22:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:14,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:14,510 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-03 18:22:14,530 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-03 18:22:14,723 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-03 18:22:14,723 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-03 18:22:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash 567459132, now seen corresponding path program 23 times [2022-03-03 18:22:14,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:14,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818585594] [2022-03-03 18:22:14,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:14,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:15,007 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-03 18:22:15,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:15,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818585594] [2022-03-03 18:22:15,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818585594] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:15,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184642298] [2022-03-03 18:22:15,007 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:15,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:15,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:15,009 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-03 18:22:15,010 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-03 18:22:15,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:15,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:15,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:15,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:15,447 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-03 18:22:15,510 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-03 18:22:15,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:15,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184642298] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:15,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:15,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:15,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085407369] [2022-03-03 18:22:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:15,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:15,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:15,511 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-03 18:22:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:16,314 INFO L93 Difference]: Finished difference Result 6754 states and 13293 transitions. [2022-03-03 18:22:16,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:16,315 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-03 18:22:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:16,322 INFO L225 Difference]: With dead ends: 6754 [2022-03-03 18:22:16,322 INFO L226 Difference]: Without dead ends: 6754 [2022-03-03 18:22:16,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:22:16,323 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-03 18:22:16,323 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-03 18:22:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2022-03-03 18:22:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 2617. [2022-03-03 18:22:16,356 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-03 18:22:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-03-03 18:22:16,358 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-03-03 18:22:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:16,358 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-03-03 18:22:16,359 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-03 18:22:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-03-03 18:22:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:16,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:16,360 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-03 18:22:16,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-03 18:22:16,560 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-03 18:22:16,561 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-03 18:22:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1968483042, now seen corresponding path program 24 times [2022-03-03 18:22:16,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:16,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908584735] [2022-03-03 18:22:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:16,725 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-03 18:22:16,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:16,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908584735] [2022-03-03 18:22:16,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908584735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:16,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238480898] [2022-03-03 18:22:16,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:16,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:16,726 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-03 18:22:16,755 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-03 18:22:16,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:16,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:16,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:16,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:17,108 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-03 18:22:17,166 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-03 18:22:17,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:17,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238480898] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:17,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:17,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:17,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118873814] [2022-03-03 18:22:17,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:17,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:17,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:17,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:17,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:17,167 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-03 18:22:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:18,029 INFO L93 Difference]: Finished difference Result 7944 states and 15678 transitions. [2022-03-03 18:22:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:22:18,029 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-03 18:22:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:18,037 INFO L225 Difference]: With dead ends: 7944 [2022-03-03 18:22:18,037 INFO L226 Difference]: Without dead ends: 7944 [2022-03-03 18:22:18,037 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-03 18:22:18,038 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:18,038 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.4s Time] [2022-03-03 18:22:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-03-03 18:22:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 2627. [2022-03-03 18:22:18,072 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-03 18:22:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-03-03 18:22:18,075 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-03-03 18:22:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:18,075 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-03-03 18:22:18,075 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-03 18:22:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-03-03 18:22:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:18,076 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:18,076 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-03 18:22:18,097 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-03 18:22:18,294 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-03 18:22:18,294 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-03 18:22:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1400490572, now seen corresponding path program 25 times [2022-03-03 18:22:18,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:18,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487925498] [2022-03-03 18:22:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:18,438 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-03 18:22:18,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:18,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487925498] [2022-03-03 18:22:18,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487925498] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:18,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673526335] [2022-03-03 18:22:18,438 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:18,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:18,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:18,440 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-03 18:22:18,440 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-03 18:22:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:18,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:18,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:18,829 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-03 18:22:18,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-03 18:22:18,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:18,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673526335] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:18,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:18,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:18,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456588229] [2022-03-03 18:22:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:18,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:18,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:18,905 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-03 18:22:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:19,399 INFO L93 Difference]: Finished difference Result 8265 states and 16287 transitions. [2022-03-03 18:22:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:22:19,400 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-03 18:22:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:19,409 INFO L225 Difference]: With dead ends: 8265 [2022-03-03 18:22:19,409 INFO L226 Difference]: Without dead ends: 8265 [2022-03-03 18:22:19,410 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-03 18:22:19,410 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-03 18:22:19,410 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-03 18:22:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2022-03-03 18:22:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 2629. [2022-03-03 18:22:19,462 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-03 18:22:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-03-03 18:22:19,464 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-03-03 18:22:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:19,465 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-03-03 18:22:19,465 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-03 18:22:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-03-03 18:22:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:19,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:19,466 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-03 18:22:19,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-03 18:22:19,666 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-03 18:22:19,667 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-03 18:22:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1443674278, now seen corresponding path program 26 times [2022-03-03 18:22:19,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:19,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434458514] [2022-03-03 18:22:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:19,822 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-03 18:22:19,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:19,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434458514] [2022-03-03 18:22:19,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434458514] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:19,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949618495] [2022-03-03 18:22:19,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:19,823 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-03 18:22:19,824 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-03 18:22:19,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:19,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:19,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:19,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:20,201 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-03 18:22:20,263 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-03 18:22:20,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:20,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949618495] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:20,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:20,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:20,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047797953] [2022-03-03 18:22:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:20,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:20,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:20,264 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-03 18:22:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:21,152 INFO L93 Difference]: Finished difference Result 8307 states and 16347 transitions. [2022-03-03 18:22:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:21,152 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-03 18:22:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:21,161 INFO L225 Difference]: With dead ends: 8307 [2022-03-03 18:22:21,161 INFO L226 Difference]: Without dead ends: 8307 [2022-03-03 18:22:21,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:21,162 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 954 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:21,162 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.4s Time] [2022-03-03 18:22:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2022-03-03 18:22:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 2623. [2022-03-03 18:22:21,199 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-03 18:22:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-03-03 18:22:21,201 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-03-03 18:22:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:21,201 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-03-03 18:22:21,202 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-03 18:22:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-03-03 18:22:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:21,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:21,203 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-03 18:22:21,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-03 18:22:21,403 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-03 18:22:21,404 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-03 18:22:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1237259930, now seen corresponding path program 27 times [2022-03-03 18:22:21,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:21,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453131618] [2022-03-03 18:22:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:21,510 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-03 18:22:21,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:21,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453131618] [2022-03-03 18:22:21,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453131618] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:21,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591379503] [2022-03-03 18:22:21,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:21,511 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-03 18:22:21,512 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-03 18:22:21,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:21,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:21,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:21,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:21,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:22,002 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-03 18:22:22,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:22,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591379503] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:22,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:22,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:22,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793493023] [2022-03-03 18:22:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:22,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:22,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:22,003 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-03 18:22:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:22,502 INFO L93 Difference]: Finished difference Result 7504 states and 14817 transitions. [2022-03-03 18:22:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:22:22,502 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-03 18:22:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:22,510 INFO L225 Difference]: With dead ends: 7504 [2022-03-03 18:22:22,511 INFO L226 Difference]: Without dead ends: 7504 [2022-03-03 18:22:22,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-03-03 18:22:22,511 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:22,511 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.3s Time] [2022-03-03 18:22:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2022-03-03 18:22:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 2628. [2022-03-03 18:22:22,549 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-03 18:22:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 5136 transitions. [2022-03-03 18:22:22,570 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 5136 transitions. Word has length 105 [2022-03-03 18:22:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:22,570 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 5136 transitions. [2022-03-03 18:22:22,570 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-03 18:22:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 5136 transitions. [2022-03-03 18:22:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:22,571 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:22,571 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-03 18:22:22,590 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-03 18:22:22,772 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-03 18:22:22,772 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-03 18:22:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2047530010, now seen corresponding path program 28 times [2022-03-03 18:22:22,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:22,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197902860] [2022-03-03 18:22:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:22,958 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-03 18:22:22,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:22,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197902860] [2022-03-03 18:22:22,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197902860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:22,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820411978] [2022-03-03 18:22:22,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:22,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:22,968 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-03 18:22:22,969 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-03 18:22:23,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:23,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:23,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-03 18:22:23,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:23,456 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-03 18:22:23,567 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-03 18:22:23,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,597 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-03 18:22:23,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,629 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-03 18:22:23,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,678 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-03 18:22:23,720 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:22:23,720 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-03 18:22:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:23,813 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:22:23,814 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-03 18:22:23,842 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-03 18:22:23,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:23,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820411978] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:23,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:23,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-03-03 18:22:23,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515140721] [2022-03-03 18:22:23,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:23,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 18:22:23,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 18:22:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:22:23,843 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-03 18:22:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:25,712 INFO L93 Difference]: Finished difference Result 7649 states and 15107 transitions. [2022-03-03 18:22:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-03 18:22:25,712 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-03 18:22:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:25,721 INFO L225 Difference]: With dead ends: 7649 [2022-03-03 18:22:25,721 INFO L226 Difference]: Without dead ends: 7649 [2022-03-03 18:22:25,722 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-03 18:22:25,722 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 966 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:25,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 2044 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:22:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2022-03-03 18:22:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 2648. [2022-03-03 18:22:25,762 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-03 18:22:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 5176 transitions. [2022-03-03 18:22:25,764 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 5176 transitions. Word has length 105 [2022-03-03 18:22:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:25,764 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 5176 transitions. [2022-03-03 18:22:25,764 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-03 18:22:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 5176 transitions. [2022-03-03 18:22:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:25,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:25,766 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-03 18:22:25,783 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-03 18:22:25,966 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-03 18:22:25,966 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-03 18:22:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1665619056, now seen corresponding path program 29 times [2022-03-03 18:22:25,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:25,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224742069] [2022-03-03 18:22:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:26,246 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-03 18:22:26,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:26,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224742069] [2022-03-03 18:22:26,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224742069] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:26,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84152617] [2022-03-03 18:22:26,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:26,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:26,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:26,252 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-03 18:22:26,253 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-03 18:22:26,467 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:26,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:26,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:26,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:26,727 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-03 18:22:26,788 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-03 18:22:26,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:26,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84152617] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:26,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:26,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:26,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293303065] [2022-03-03 18:22:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:26,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:26,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:26,789 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-03 18:22:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:27,623 INFO L93 Difference]: Finished difference Result 7727 states and 15225 transitions. [2022-03-03 18:22:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:27,624 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-03 18:22:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:27,632 INFO L225 Difference]: With dead ends: 7727 [2022-03-03 18:22:27,632 INFO L226 Difference]: Without dead ends: 7727 [2022-03-03 18:22:27,633 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-03 18:22:27,633 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1070 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03 18:22:27,633 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-03 18:22:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2022-03-03 18:22:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 2626. [2022-03-03 18:22:27,672 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-03 18:22:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-03-03 18:22:27,675 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-03-03 18:22:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:27,675 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-03-03 18:22:27,675 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-03 18:22:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-03-03 18:22:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:27,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:27,676 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-03 18:22:27,693 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-03 18:22:27,877 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-03 18:22:27,877 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-03 18:22:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 652340364, now seen corresponding path program 30 times [2022-03-03 18:22:27,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:27,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471265392] [2022-03-03 18:22:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:28,162 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-03 18:22:28,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:28,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471265392] [2022-03-03 18:22:28,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471265392] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:28,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635893684] [2022-03-03 18:22:28,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:28,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:28,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:28,164 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-03 18:22:28,164 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-03 18:22:28,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:28,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:28,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:28,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:28,536 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-03 18:22:28,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-03 18:22:28,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:28,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635893684] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:28,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:28,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:28,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620541467] [2022-03-03 18:22:28,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:28,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:28,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:28,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:28,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:28,646 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-03 18:22:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:28,975 INFO L93 Difference]: Finished difference Result 5260 states and 10343 transitions. [2022-03-03 18:22:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:28,976 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-03 18:22:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:28,981 INFO L225 Difference]: With dead ends: 5260 [2022-03-03 18:22:28,981 INFO L226 Difference]: Without dead ends: 5260 [2022-03-03 18:22:28,981 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-03 18:22:28,981 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-03 18:22:28,981 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-03 18:22:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2022-03-03 18:22:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 2608. [2022-03-03 18:22:29,012 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-03 18:22:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-03-03 18:22:29,015 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-03-03 18:22:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:29,015 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-03-03 18:22:29,015 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-03 18:22:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-03-03 18:22:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:29,016 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:29,016 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-03 18:22:29,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-03 18:22:29,217 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-03 18:22:29,217 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-03 18:22:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 564648876, now seen corresponding path program 31 times [2022-03-03 18:22:29,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:29,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219299692] [2022-03-03 18:22:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:29,505 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-03 18:22:29,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:29,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219299692] [2022-03-03 18:22:29,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219299692] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:29,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960912322] [2022-03-03 18:22:29,506 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:29,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:29,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:29,507 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-03 18:22:29,512 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-03 18:22:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:29,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:29,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:29,967 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-03 18:22:30,032 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-03 18:22:30,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:30,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960912322] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:30,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:30,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:30,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544829960] [2022-03-03 18:22:30,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:30,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:30,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:30,033 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-03 18:22:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:30,948 INFO L93 Difference]: Finished difference Result 6726 states and 13266 transitions. [2022-03-03 18:22:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:30,948 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-03 18:22:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:30,956 INFO L225 Difference]: With dead ends: 6726 [2022-03-03 18:22:30,956 INFO L226 Difference]: Without dead ends: 6726 [2022-03-03 18:22:30,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=2169, Unknown=0, NotChecked=0, Total=2550 [2022-03-03 18:22:30,957 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1246 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03 18:22:30,957 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-03 18:22:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2022-03-03 18:22:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 2616. [2022-03-03 18:22:30,993 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-03 18:22:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 5112 transitions. [2022-03-03 18:22:30,996 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 5112 transitions. Word has length 105 [2022-03-03 18:22:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:30,996 INFO L470 AbstractCegarLoop]: Abstraction has 2616 states and 5112 transitions. [2022-03-03 18:22:30,996 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-03 18:22:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 5112 transitions. [2022-03-03 18:22:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:30,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:30,997 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-03 18:22:31,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-03 18:22:31,204 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-03 18:22:31,204 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-03 18:22:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash -3343594, now seen corresponding path program 32 times [2022-03-03 18:22:31,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:31,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315521923] [2022-03-03 18:22:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:31,366 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-03 18:22:31,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:31,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315521923] [2022-03-03 18:22:31,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315521923] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:31,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314618947] [2022-03-03 18:22:31,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:31,368 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-03 18:22:31,368 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-03 18:22:31,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:31,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:31,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:31,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:31,758 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-03 18:22:31,832 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-03 18:22:31,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:31,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314618947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:31,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:31,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:31,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962877874] [2022-03-03 18:22:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:31,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:31,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:31,833 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-03 18:22:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:32,357 INFO L93 Difference]: Finished difference Result 7047 states and 13875 transitions. [2022-03-03 18:22:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:22:32,358 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-03 18:22:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:32,368 INFO L225 Difference]: With dead ends: 7047 [2022-03-03 18:22:32,368 INFO L226 Difference]: Without dead ends: 7047 [2022-03-03 18:22:32,368 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-03 18:22:32,369 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.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:32,369 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.2s Time] [2022-03-03 18:22:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2022-03-03 18:22:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 2618. [2022-03-03 18:22:32,407 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-03 18:22:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 5116 transitions. [2022-03-03 18:22:32,410 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 5116 transitions. Word has length 105 [2022-03-03 18:22:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:32,410 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 5116 transitions. [2022-03-03 18:22:32,410 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-03 18:22:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 5116 transitions. [2022-03-03 18:22:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:32,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:32,412 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-03 18:22:32,429 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-03 18:22:32,612 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-03 18:22:32,612 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-03 18:22:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1447458852, now seen corresponding path program 33 times [2022-03-03 18:22:32,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:32,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793386720] [2022-03-03 18:22:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:32,886 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-03 18:22:32,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:32,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793386720] [2022-03-03 18:22:32,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793386720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:32,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289292917] [2022-03-03 18:22:32,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:32,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:32,888 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-03 18:22:32,889 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-03 18:22:33,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:33,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:33,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:33,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:33,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03 18:22:33,410 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-03 18:22:33,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:33,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289292917] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:33,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:33,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:33,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258870147] [2022-03-03 18:22:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:33,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:33,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:33,411 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-03 18:22:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:34,333 INFO L93 Difference]: Finished difference Result 7089 states and 13935 transitions. [2022-03-03 18:22:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:34,333 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-03 18:22:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:34,342 INFO L225 Difference]: With dead ends: 7089 [2022-03-03 18:22:34,342 INFO L226 Difference]: Without dead ends: 7089 [2022-03-03 18:22:34,342 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-03 18:22:34,343 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-03 18:22:34,343 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-03 18:22:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-03-03 18:22:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2612. [2022-03-03 18:22:34,379 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-03 18:22:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 5104 transitions. [2022-03-03 18:22:34,382 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 5104 transitions. Word has length 105 [2022-03-03 18:22:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:34,382 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 5104 transitions. [2022-03-03 18:22:34,382 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-03 18:22:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 5104 transitions. [2022-03-03 18:22:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:34,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:34,383 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-03 18:22:34,402 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-03 18:22:34,587 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-03 18:22:34,588 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-03 18:22:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash -166574236, now seen corresponding path program 34 times [2022-03-03 18:22:34,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:34,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756382122] [2022-03-03 18:22:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:34,861 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-03 18:22:34,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:34,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756382122] [2022-03-03 18:22:34,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756382122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:34,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789165021] [2022-03-03 18:22:34,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:34,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:34,863 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-03 18:22:34,864 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-03 18:22:35,083 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:35,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:35,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-03 18:22:35,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:35,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:35,460 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-03 18:22:35,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,509 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-03 18:22:35,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,553 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-03 18:22:35,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:22:35,655 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:22:35,656 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-03 18:22:35,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:35,746 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:22:35,746 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-03 18:22:35,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-03 18:22:35,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:35,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789165021] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:35,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:35,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2022-03-03 18:22:35,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635378174] [2022-03-03 18:22:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:35,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 18:22:35,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:35,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 18:22:35,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-03-03 18:22:35,781 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-03 18:22:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:37,330 INFO L93 Difference]: Finished difference Result 8798 states and 17396 transitions. [2022-03-03 18:22:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:37,331 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-03 18:22:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:37,341 INFO L225 Difference]: With dead ends: 8798 [2022-03-03 18:22:37,341 INFO L226 Difference]: Without dead ends: 8798 [2022-03-03 18:22:37,341 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-03 18:22:37,342 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-03 18:22:37,342 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-03 18:22:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2022-03-03 18:22:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 2658. [2022-03-03 18:22:37,388 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-03 18:22:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 5196 transitions. [2022-03-03 18:22:37,390 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 5196 transitions. Word has length 105 [2022-03-03 18:22:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:37,391 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 5196 transitions. [2022-03-03 18:22:37,391 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-03 18:22:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 5196 transitions. [2022-03-03 18:22:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:37,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:37,392 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-03 18:22:37,411 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-03 18:22:37,600 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-03 18:22:37,600 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-03 18:22:37,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash 415243994, now seen corresponding path program 35 times [2022-03-03 18:22:37,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:37,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863286629] [2022-03-03 18:22:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:37,883 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-03 18:22:37,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:37,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863286629] [2022-03-03 18:22:37,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863286629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:37,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203427348] [2022-03-03 18:22:37,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:37,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:37,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:37,885 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-03 18:22:37,886 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-03 18:22:38,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:38,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:38,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:38,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:38,368 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-03 18:22:38,457 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-03 18:22:38,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:38,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203427348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:38,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:38,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:22:38,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810873192] [2022-03-03 18:22:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:38,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:38,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:38,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:38,458 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-03 18:22:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:39,026 INFO L93 Difference]: Finished difference Result 7844 states and 15465 transitions. [2022-03-03 18:22:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:22:39,027 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-03 18:22:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:39,036 INFO L225 Difference]: With dead ends: 7844 [2022-03-03 18:22:39,036 INFO L226 Difference]: Without dead ends: 7844 [2022-03-03 18:22:39,036 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-03 18:22:39,036 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 840 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 18:22:39,037 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-03 18:22:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-03-03 18:22:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 2617. [2022-03-03 18:22:39,075 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-03 18:22:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-03-03 18:22:39,077 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-03-03 18:22:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:39,078 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-03-03 18:22:39,078 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-03 18:22:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-03-03 18:22:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:39,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:39,079 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-03 18:22:39,097 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-03 18:22:39,279 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-03 18:22:39,280 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-03 18:22:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash 643695844, now seen corresponding path program 36 times [2022-03-03 18:22:39,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:39,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221655940] [2022-03-03 18:22:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:39,371 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-03 18:22:39,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:39,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221655940] [2022-03-03 18:22:39,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221655940] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:39,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993889127] [2022-03-03 18:22:39,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:39,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:39,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:39,373 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-03 18:22:39,374 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-03 18:22:39,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:39,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:39,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:39,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:39,801 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-03 18:22:39,859 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-03 18:22:39,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:39,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993889127] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:39,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:39,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:39,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706497394] [2022-03-03 18:22:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:39,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:39,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:39,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:39,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:39,860 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-03 18:22:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:40,705 INFO L93 Difference]: Finished difference Result 8063 states and 15869 transitions. [2022-03-03 18:22:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:40,705 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-03 18:22:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:40,715 INFO L225 Difference]: With dead ends: 8063 [2022-03-03 18:22:40,715 INFO L226 Difference]: Without dead ends: 8063 [2022-03-03 18:22:40,715 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-03 18:22:40,715 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 1196 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03 18:22:40,715 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-03 18:22:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2022-03-03 18:22:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 2615. [2022-03-03 18:22:40,756 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-03 18:22:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5110 transitions. [2022-03-03 18:22:40,758 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5110 transitions. Word has length 105 [2022-03-03 18:22:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:40,759 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 5110 transitions. [2022-03-03 18:22:40,759 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-03 18:22:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5110 transitions. [2022-03-03 18:22:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:40,760 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:40,760 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-03 18:22:40,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-03 18:22:40,960 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-03 18:22:40,961 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-03 18:22:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash -751493802, now seen corresponding path program 37 times [2022-03-03 18:22:40,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:40,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218453614] [2022-03-03 18:22:40,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:41,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-03 18:22:41,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:41,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218453614] [2022-03-03 18:22:41,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218453614] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:41,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049066609] [2022-03-03 18:22:41,060 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:41,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:41,061 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-03 18:22:41,062 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-03 18:22:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:41,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:41,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:41,448 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-03 18:22:41,539 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-03 18:22:41,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:41,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049066609] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:41,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:41,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:41,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758430598] [2022-03-03 18:22:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:41,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:41,540 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-03 18:22:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:41,868 INFO L93 Difference]: Finished difference Result 5596 states and 10987 transitions. [2022-03-03 18:22:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:22:41,868 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-03 18:22:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:41,874 INFO L225 Difference]: With dead ends: 5596 [2022-03-03 18:22:41,874 INFO L226 Difference]: Without dead ends: 5596 [2022-03-03 18:22:41,874 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-03 18:22:41,874 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-03 18:22:41,874 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-03 18:22:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-03-03 18:22:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 2606. [2022-03-03 18:22:41,906 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-03 18:22:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 5092 transitions. [2022-03-03 18:22:41,909 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 5092 transitions. Word has length 105 [2022-03-03 18:22:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:41,909 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 5092 transitions. [2022-03-03 18:22:41,910 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-03 18:22:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 5092 transitions. [2022-03-03 18:22:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:41,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:41,911 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-03 18:22:41,928 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-03 18:22:42,114 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-03 18:22:42,114 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-03 18:22:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1780597932, now seen corresponding path program 38 times [2022-03-03 18:22:42,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:42,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222689230] [2022-03-03 18:22:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:42,277 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-03 18:22:42,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:42,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222689230] [2022-03-03 18:22:42,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222689230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:42,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404578480] [2022-03-03 18:22:42,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:42,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:42,280 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-03 18:22:42,281 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-03 18:22:42,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:42,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:42,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:42,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:42,669 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-03 18:22:42,741 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-03 18:22:42,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:42,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404578480] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:42,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:42,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:42,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979652446] [2022-03-03 18:22:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:42,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:42,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:42,742 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-03 18:22:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:43,264 INFO L93 Difference]: Finished difference Result 6301 states and 12435 transitions. [2022-03-03 18:22:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:22:43,264 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-03 18:22:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:43,271 INFO L225 Difference]: With dead ends: 6301 [2022-03-03 18:22:43,271 INFO L226 Difference]: Without dead ends: 6301 [2022-03-03 18:22:43,271 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-03 18:22:43,272 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-03 18:22:43,272 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-03 18:22:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2022-03-03 18:22:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 2610. [2022-03-03 18:22:43,313 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-03 18:22:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 5100 transitions. [2022-03-03 18:22:43,316 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 5100 transitions. Word has length 105 [2022-03-03 18:22:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:43,316 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 5100 transitions. [2022-03-03 18:22:43,316 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-03 18:22:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 5100 transitions. [2022-03-03 18:22:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:43,317 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:43,317 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-03 18:22:43,335 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-03 18:22:43,518 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-03 18:22:43,519 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-03 18:22:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1704099284, now seen corresponding path program 39 times [2022-03-03 18:22:43,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:43,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459179045] [2022-03-03 18:22:43,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:43,618 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-03 18:22:43,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:43,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459179045] [2022-03-03 18:22:43,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459179045] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:43,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198387431] [2022-03-03 18:22:43,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:43,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:43,619 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-03 18:22:43,620 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-03 18:22:43,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:43,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:43,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:43,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:44,027 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-03 18:22:44,083 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-03 18:22:44,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:44,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198387431] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:44,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:44,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:44,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210017874] [2022-03-03 18:22:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:44,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:44,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:44,084 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-03 18:22:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:44,904 INFO L93 Difference]: Finished difference Result 6524 states and 12843 transitions. [2022-03-03 18:22:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:44,904 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-03 18:22:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:44,911 INFO L225 Difference]: With dead ends: 6524 [2022-03-03 18:22:44,911 INFO L226 Difference]: Without dead ends: 6524 [2022-03-03 18:22:44,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:22:44,912 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1253 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:44,912 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.4s Time] [2022-03-03 18:22:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2022-03-03 18:22:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 2608. [2022-03-03 18:22:44,964 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-03 18:22:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-03-03 18:22:44,966 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-03-03 18:22:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:44,966 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-03-03 18:22:44,967 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-03 18:22:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-03-03 18:22:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:44,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:44,968 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-03 18:22:44,985 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-03 18:22:45,168 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-03 18:22:45,168 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-03 18:22:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1195678366, now seen corresponding path program 40 times [2022-03-03 18:22:45,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:45,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964413074] [2022-03-03 18:22:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:45,329 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-03 18:22:45,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:45,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964413074] [2022-03-03 18:22:45,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964413074] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:45,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526735010] [2022-03-03 18:22:45,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:45,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:45,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:45,332 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-03 18:22:45,333 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-03 18:22:45,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:45,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:45,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:22:45,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:45,711 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-03 18:22:45,832 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-03 18:22:45,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,857 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-03 18:22:45,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,888 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-03 18:22:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:45,925 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-03 18:22:45,961 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-03 18:22:45,970 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-03 18:22:45,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:45,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526735010] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:45,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:45,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 15 [2022-03-03 18:22:45,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994291944] [2022-03-03 18:22:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:45,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:22:45,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:22:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:22:45,971 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-03 18:22:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:46,593 INFO L93 Difference]: Finished difference Result 5379 states and 10546 transitions. [2022-03-03 18:22:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:22:46,594 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-03 18:22:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:46,600 INFO L225 Difference]: With dead ends: 5379 [2022-03-03 18:22:46,600 INFO L226 Difference]: Without dead ends: 5379 [2022-03-03 18:22:46,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:22:46,600 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 628 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 18:22:46,601 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-03 18:22:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-03-03 18:22:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2605. [2022-03-03 18:22:46,640 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-03 18:22:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 5090 transitions. [2022-03-03 18:22:46,643 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 5090 transitions. Word has length 105 [2022-03-03 18:22:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:46,643 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 5090 transitions. [2022-03-03 18:22:46,643 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-03 18:22:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 5090 transitions. [2022-03-03 18:22:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:46,644 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:46,644 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-03 18:22:46,662 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-03 18:22:46,845 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-03 18:22:46,845 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-03 18:22:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 49907308, now seen corresponding path program 41 times [2022-03-03 18:22:46,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:46,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554329970] [2022-03-03 18:22:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:46,999 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-03 18:22:46,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:46,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554329970] [2022-03-03 18:22:46,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554329970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:46,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474033186] [2022-03-03 18:22:46,999 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:46,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:47,000 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-03 18:22:47,001 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-03 18:22:47,228 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:47,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:47,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:47,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:47,383 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-03 18:22:47,495 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-03 18:22:47,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:47,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474033186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:47,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:47,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:47,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29157135] [2022-03-03 18:22:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:47,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:47,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:47,496 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-03 18:22:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:47,824 INFO L93 Difference]: Finished difference Result 4902 states and 9651 transitions. [2022-03-03 18:22:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:47,824 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-03 18:22:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:47,829 INFO L225 Difference]: With dead ends: 4902 [2022-03-03 18:22:47,829 INFO L226 Difference]: Without dead ends: 4902 [2022-03-03 18:22:47,829 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-03 18:22:47,829 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-03 18:22:47,830 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-03 18:22:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-03-03 18:22:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 2634. [2022-03-03 18:22:47,856 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-03 18:22:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 5148 transitions. [2022-03-03 18:22:47,858 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 5148 transitions. Word has length 105 [2022-03-03 18:22:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:47,859 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 5148 transitions. [2022-03-03 18:22:47,859 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-03 18:22:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 5148 transitions. [2022-03-03 18:22:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 18:22:47,860 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:47,860 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-03 18:22:47,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-03 18:22:48,060 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-03 18:22:48,060 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-03 18:22:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 225817577, now seen corresponding path program 1 times [2022-03-03 18:22:48,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:48,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967084171] [2022-03-03 18:22:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:48,117 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-03 18:22:48,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:48,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967084171] [2022-03-03 18:22:48,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967084171] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:48,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:22:48,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:22:48,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459044127] [2022-03-03 18:22:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:48,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:22:48,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:22:48,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:22:48,119 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-03 18:22:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:48,219 INFO L93 Difference]: Finished difference Result 2900 states and 5680 transitions. [2022-03-03 18:22:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:22:48,220 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-03 18:22:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:48,224 INFO L225 Difference]: With dead ends: 2900 [2022-03-03 18:22:48,224 INFO L226 Difference]: Without dead ends: 2753 [2022-03-03 18:22:48,225 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-03 18:22:48,225 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-03 18:22:48,225 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-03 18:22:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2022-03-03 18:22:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2211. [2022-03-03 18:22:48,241 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-03 18:22:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4296 transitions. [2022-03-03 18:22:48,244 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4296 transitions. Word has length 114 [2022-03-03 18:22:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:48,244 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 4296 transitions. [2022-03-03 18:22:48,244 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-03 18:22:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4296 transitions. [2022-03-03 18:22:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:22:48,246 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:48,246 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-03 18:22:48,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-03 18:22:48,246 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-03 18:22:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1779983633, now seen corresponding path program 1 times [2022-03-03 18:22:48,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:48,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262080929] [2022-03-03 18:22:48,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:48,473 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-03 18:22:48,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:48,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262080929] [2022-03-03 18:22:48,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262080929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:48,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294787721] [2022-03-03 18:22:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:48,474 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-03 18:22:48,476 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-03 18:22:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:48,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-03 18:22:48,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:49,437 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-03 18:22:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,473 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-03 18:22:49,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,521 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-03 18:22:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,571 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-03 18:22:49,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:49,687 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-03 18:22:49,716 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-03 18:22:49,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:22:50,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:50,847 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-03 18:22:50,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294787721] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:22:50,847 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:22:50,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-03 18:22:50,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585634410] [2022-03-03 18:22:50,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:22:50,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:22:50,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:50,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:22:50,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:22:50,849 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-03 18:22:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:53,836 INFO L93 Difference]: Finished difference Result 7926 states and 15628 transitions. [2022-03-03 18:22:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 18:22:53,836 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-03 18:22:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:53,846 INFO L225 Difference]: With dead ends: 7926 [2022-03-03 18:22:53,846 INFO L226 Difference]: Without dead ends: 7914 [2022-03-03 18:22:53,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 18:22:53,847 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 2423 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:53,847 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.4s Time] [2022-03-03 18:22:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-03-03 18:22:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 3015. [2022-03-03 18:22:53,881 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-03 18:22:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5945 transitions. [2022-03-03 18:22:53,884 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5945 transitions. Word has length 134 [2022-03-03 18:22:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:53,884 INFO L470 AbstractCegarLoop]: Abstraction has 3015 states and 5945 transitions. [2022-03-03 18:22:53,884 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-03 18:22:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5945 transitions. [2022-03-03 18:22:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:22:53,887 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:53,887 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-03 18:22:53,904 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-03 18:22:54,087 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-03 18:22:54,087 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-03 18:22:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2062391747, now seen corresponding path program 2 times [2022-03-03 18:22:54,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:54,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027911297] [2022-03-03 18:22:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:54,323 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-03 18:22:54,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:54,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027911297] [2022-03-03 18:22:54,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027911297] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:54,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109711233] [2022-03-03 18:22:54,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:54,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:54,325 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-03 18:22:54,325 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-03 18:22:54,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 18:22:54,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:54,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:22:54,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:55,263 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-03 18:22:55,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,312 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-03 18:22:55,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,360 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-03 18:22:55,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:55,417 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-03 18:22:55,551 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-03 18:22:55,551 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-03 18:22:55,579 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-03 18:22:55,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:22:56,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:22:56,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-03 18:22:56,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109711233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:22:56,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:22:56,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-03 18:22:56,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627044735] [2022-03-03 18:22:56,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:22:56,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:22:56,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:22:56,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:22:56,614 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-03 18:23:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:00,059 INFO L93 Difference]: Finished difference Result 7629 states and 15050 transitions. [2022-03-03 18:23:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 18:23:00,060 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-03 18:23:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:00,071 INFO L225 Difference]: With dead ends: 7629 [2022-03-03 18:23:00,071 INFO L226 Difference]: Without dead ends: 7620 [2022-03-03 18:23:00,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-03-03 18:23:00,071 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1997 mSDsluCounter, 4464 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:23:00,072 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.8s Time] [2022-03-03 18:23:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2022-03-03 18:23:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 3152. [2022-03-03 18:23:00,118 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-03 18:23:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 6219 transitions. [2022-03-03 18:23:00,123 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 6219 transitions. Word has length 134 [2022-03-03 18:23:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:00,123 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 6219 transitions. [2022-03-03 18:23:00,123 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-03 18:23:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 6219 transitions. [2022-03-03 18:23:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:23:00,126 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:00,126 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-03 18:23:00,152 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-03 18:23:00,339 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-03 18:23:00,339 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-03 18:23:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1179672212, now seen corresponding path program 1 times [2022-03-03 18:23:00,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:00,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841886827] [2022-03-03 18:23:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:00,574 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-03 18:23:00,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:00,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841886827] [2022-03-03 18:23:00,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841886827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:00,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101929248] [2022-03-03 18:23:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:00,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:00,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:00,576 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-03 18:23:00,576 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-03 18:23:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:00,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:23:00,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:01,462 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-03 18:23:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,506 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-03 18:23:01,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,543 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-03 18:23:01,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:01,595 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-03 18:23:01,677 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:23:01,678 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-03 18:23:01,705 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-03 18:23:01,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:23:02,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:02,671 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-03 18:23:02,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101929248] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:23:02,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:23:02,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-03 18:23:02,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751164873] [2022-03-03 18:23:02,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:23:02,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:23:02,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:23:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:23:02,673 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-03 18:23:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:05,983 INFO L93 Difference]: Finished difference Result 7625 states and 15041 transitions. [2022-03-03 18:23:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 18:23:05,984 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-03 18:23:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:05,993 INFO L225 Difference]: With dead ends: 7625 [2022-03-03 18:23:05,993 INFO L226 Difference]: Without dead ends: 7597 [2022-03-03 18:23:05,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1163, Invalid=5977, Unknown=0, NotChecked=0, Total=7140 [2022-03-03 18:23:05,994 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 2466 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:23:05,994 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.5s Time] [2022-03-03 18:23:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2022-03-03 18:23:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 3312. [2022-03-03 18:23:06,043 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-03 18:23:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 6543 transitions. [2022-03-03 18:23:06,048 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 6543 transitions. Word has length 134 [2022-03-03 18:23:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:06,048 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 6543 transitions. [2022-03-03 18:23:06,048 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-03 18:23:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 6543 transitions. [2022-03-03 18:23:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:23:06,051 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:06,051 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-03 18:23:06,075 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-03 18:23:06,267 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-03 18:23:06,267 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-03 18:23:06,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -839246923, now seen corresponding path program 1 times [2022-03-03 18:23:06,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:06,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998915264] [2022-03-03 18:23:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:06,710 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-03 18:23:06,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:06,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998915264] [2022-03-03 18:23:06,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998915264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:06,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675176949] [2022-03-03 18:23:06,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:06,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:06,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:06,711 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-03 18:23:06,712 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-03 18:23:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:06,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-03 18:23:06,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:07,672 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-03 18:23:07,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,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-03 18:23:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,747 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-03 18:23:07,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:23:07,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,906 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-03 18:23:07,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,932 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-03 18:23:07,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,967 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-03 18:23:07,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:07,995 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-03 18:23:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:08,139 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-03 18:23:13,889 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-03 18:23:13,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:23:15,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:15,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:16,097 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-03 18:23:16,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675176949] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:23:16,098 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:23:16,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-03-03 18:23:16,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368158872] [2022-03-03 18:23:16,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:23:16,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-03 18:23:16,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-03 18:23:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1739, Unknown=2, NotChecked=0, Total=1980 [2022-03-03 18:23:16,099 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-03 18:23:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:52,963 INFO L93 Difference]: Finished difference Result 9029 states and 17852 transitions. [2022-03-03 18:23:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-03 18:23:52,964 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-03 18:23:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:52,979 INFO L225 Difference]: With dead ends: 9029 [2022-03-03 18:23:52,980 INFO L226 Difference]: Without dead ends: 9017 [2022-03-03 18:23:52,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=1670, Invalid=8614, Unknown=18, NotChecked=0, Total=10302 [2022-03-03 18:23:52,982 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 2878 mSDsluCounter, 4767 mSDsCounter, 0 mSdLazyCounter, 4140 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:23:52,982 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.2s Time] [2022-03-03 18:23:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2022-03-03 18:23:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 3517. [2022-03-03 18:23:53,048 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-03 18:23:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 6955 transitions. [2022-03-03 18:23:53,052 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 6955 transitions. Word has length 134 [2022-03-03 18:23:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:53,053 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 6955 transitions. [2022-03-03 18:23:53,053 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-03 18:23:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 6955 transitions. [2022-03-03 18:23:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:23:53,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:53,055 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-03 18:23:53,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-03 18:23:53,256 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-03 18:23:53,257 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-03 18:23:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1180858669, now seen corresponding path program 1 times [2022-03-03 18:23:53,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:53,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55956127] [2022-03-03 18:23:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:53,444 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-03 18:23:53,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:53,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55956127] [2022-03-03 18:23:53,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55956127] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:53,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003976885] [2022-03-03 18:23:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:53,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:53,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:53,446 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-03 18:23:53,446 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-03 18:23:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:53,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:23:53,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:54,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:23:54,402 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-03-03 18:23:54,402 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-03 18:23:54,426 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-03 18:23:54,427 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-03 18:23:54,463 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-03 18:23:54,463 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-03 18:23:54,510 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:23:54,510 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-03 18:23:54,539 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-03 18:23:54,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:23:54,991 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-03 18:23:54,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003976885] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:23:54,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:23:54,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-03-03 18:23:54,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028854849] [2022-03-03 18:23:54,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:23:54,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-03 18:23:54,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-03 18:23:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:23:54,993 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-03 18:23:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:59,759 INFO L93 Difference]: Finished difference Result 7638 states and 15074 transitions. [2022-03-03 18:23:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-03 18:23:59,763 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-03 18:23:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:59,771 INFO L225 Difference]: With dead ends: 7638 [2022-03-03 18:23:59,771 INFO L226 Difference]: Without dead ends: 7610 [2022-03-03 18:23:59,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1853, Invalid=9919, Unknown=0, NotChecked=0, Total=11772 [2022-03-03 18:23:59,772 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:23:59,773 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.4s Time] [2022-03-03 18:23:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-03 18:23:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 3445. [2022-03-03 18:23:59,824 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-03 18:23:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6784 transitions. [2022-03-03 18:23:59,828 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6784 transitions. Word has length 134 [2022-03-03 18:23:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:59,828 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 6784 transitions. [2022-03-03 18:23:59,828 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-03 18:23:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6784 transitions. [2022-03-03 18:23:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:23:59,831 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:59,831 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-03 18:23:59,848 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-03 18:24:00,031 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-03 18:24:00,031 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-03 18:24:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1411337857, now seen corresponding path program 3 times [2022-03-03 18:24:00,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:00,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437315465] [2022-03-03 18:24:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:00,258 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-03 18:24:00,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:00,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437315465] [2022-03-03 18:24:00,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437315465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:00,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617134797] [2022-03-03 18:24:00,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:24:00,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:00,259 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-03 18:24:00,260 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-03 18:24:00,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 18:24:00,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:00,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-03 18:24:00,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:01,267 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-03 18:24:01,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,302 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-03 18:24:01,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,347 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-03 18:24:01,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,397 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-03 18:24:01,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,570 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-03 18:24:01,600 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-03 18:24:01,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:04,509 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-03 18:24:05,324 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 (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_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (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 (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_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| 2))) (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|) .cse3 |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_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| (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 (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|) .cse5 |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|) .cse5))))))) is different from false [2022-03-03 18:24:14,414 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-03 18:24:14,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617134797] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:24:14,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:24:14,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-03 18:24:14,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363042149] [2022-03-03 18:24:14,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:24:14,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:24:14,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:24:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1298, Unknown=9, NotChecked=150, Total=1640 [2022-03-03 18:24:14,415 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-03 18:24:16,324 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (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 (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_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (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 (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_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| 2))) (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|) .cse3 |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_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| (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 (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|) .cse5 |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|) .cse5))))))) (= |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 .cse6 (+ |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|) (= |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 .cse6 |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-03 18:24:17,039 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))) (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_#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-03 18:24:19,401 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (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 (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_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (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 (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_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| 2))) (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|) .cse3 |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_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| (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 (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|) .cse5 |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|) .cse5))))))) (= |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 .cse6 (+ |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|) (= |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 .cse6 |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-03 18:24:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:20,561 INFO L93 Difference]: Finished difference Result 12617 states and 25031 transitions. [2022-03-03 18:24:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-03 18:24:20,561 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-03 18:24:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:20,577 INFO L225 Difference]: With dead ends: 12617 [2022-03-03 18:24:20,577 INFO L226 Difference]: Without dead ends: 12614 [2022-03-03 18:24:20,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=1492, Invalid=7258, Unknown=12, NotChecked=940, Total=9702 [2022-03-03 18:24:20,578 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 2401 mSDsluCounter, 5578 mSDsCounter, 0 mSdLazyCounter, 3955 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 5993 SdHoareTripleChecker+Invalid, 5561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 3955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1461 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:20,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 5993 Invalid, 5561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 3955 Invalid, 0 Unknown, 1461 Unchecked, 2.0s Time] [2022-03-03 18:24:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12614 states. [2022-03-03 18:24:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12614 to 3469. [2022-03-03 18:24:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3462 states have (on average 1.973425765453495) internal successors, (6832), 3468 states have internal predecessors, (6832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 6832 transitions. [2022-03-03 18:24:20,646 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 6832 transitions. Word has length 134 [2022-03-03 18:24:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:20,646 INFO L470 AbstractCegarLoop]: Abstraction has 3469 states and 6832 transitions. [2022-03-03 18:24:20,646 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-03 18:24:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 6832 transitions. [2022-03-03 18:24:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:20,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:20,649 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-03 18:24:20,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-03 18:24:20,850 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-03 18:24:20,850 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-03 18:24:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1408959273, now seen corresponding path program 4 times [2022-03-03 18:24:20,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:20,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355559214] [2022-03-03 18:24:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:21,100 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-03 18:24:21,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:21,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355559214] [2022-03-03 18:24:21,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355559214] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:21,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117664071] [2022-03-03 18:24:21,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:24:21,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:21,102 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-03 18:24:21,103 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-03 18:24:21,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:24:21,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:21,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:24:21,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:22,221 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-03 18:24:22,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,255 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-03 18:24:22,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,297 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-03 18:24:22,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,398 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-03 18:24:22,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:22,497 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:24:22,498 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-03 18:24:22,529 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-03 18:24:22,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:23,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (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_70| v_ArrVal_5658))) |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_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) is different from false [2022-03-03 18:24:31,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (and (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |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_70|)))) is different from false [2022-03-03 18:24:33,023 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-03 18:24:33,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117664071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:24:33,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:24:33,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2022-03-03 18:24:33,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369535026] [2022-03-03 18:24:33,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:24:33,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-03 18:24:33,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-03 18:24:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1380, Unknown=10, NotChecked=154, Total=1722 [2022-03-03 18:24:33,025 INFO L87 Difference]: Start difference. First operand 3469 states and 6832 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-03 18:24:34,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (< (div (+ (* (- 28) |c_ULTIMATE.start_main_~i~2#1|) (- 4)) (- 28)) .cse0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (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_70| v_ArrVal_5658))) |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_5658 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 (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 .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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) .cse4 |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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|)) (< (div (+ (- 4) |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) .cse0)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |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 .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:24:36,675 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (< (div (+ (* (- 28) |c_ULTIMATE.start_main_~i~2#1|) (- 4)) (- 28)) .cse0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (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_70| v_ArrVal_5658))) |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_5658 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 (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 .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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) .cse4 |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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|)) (< (div (+ (- 4) |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) .cse0)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |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 .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:24:37,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (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_70| v_ArrVal_5658))) |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_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 |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 .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:24:38,221 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (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_70| v_ArrVal_5658))) |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_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5658 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_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 |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 .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:24:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:38,698 INFO L93 Difference]: Finished difference Result 13218 states and 26220 transitions. [2022-03-03 18:24:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-03 18:24:38,698 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-03 18:24:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:38,715 INFO L225 Difference]: With dead ends: 13218 [2022-03-03 18:24:38,716 INFO L226 Difference]: Without dead ends: 13218 [2022-03-03 18:24:38,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 248 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=1161, Invalid=6681, Unknown=14, NotChecked=1074, Total=8930 [2022-03-03 18:24:38,717 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 2354 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1693 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:38,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2354 Valid, 4723 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2328 Invalid, 0 Unknown, 1693 Unchecked, 1.2s Time] [2022-03-03 18:24:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13218 states. [2022-03-03 18:24:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13218 to 3480. [2022-03-03 18:24:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3473 states have (on average 1.9735099337748345) internal successors, (6854), 3479 states have internal predecessors, (6854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6854 transitions. [2022-03-03 18:24:38,792 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6854 transitions. Word has length 134 [2022-03-03 18:24:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:38,792 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6854 transitions. [2022-03-03 18:24:38,793 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-03 18:24:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6854 transitions. [2022-03-03 18:24:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:38,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:38,795 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-03 18:24:38,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-03-03 18:24:38,996 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-03 18:24:38,996 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-03 18:24:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2011124973, now seen corresponding path program 5 times [2022-03-03 18:24:38,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:38,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456454270] [2022-03-03 18:24:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:39,221 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-03 18:24:39,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:39,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456454270] [2022-03-03 18:24:39,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456454270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:39,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692778757] [2022-03-03 18:24:39,221 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:24:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:39,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:39,222 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-03 18:24:39,224 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-03 18:24:39,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:24:39,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:39,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:24:39,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:40,234 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-03 18:24:40,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:40,270 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-03 18:24:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:40,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:40,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:40,309 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-03 18:24:40,445 INFO L353 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2022-03-03 18:24:40,445 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 42 treesize of output 47 [2022-03-03 18:24:40,493 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:24:40,493 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-03 18:24:40,521 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-03 18:24:40,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:41,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5808 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_74| v_ArrVal_5808)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5808 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_74| v_ArrVal_5808)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5808 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_74| v_ArrVal_5808)) |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-03 18:24:42,099 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_5808 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| 2) |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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5808 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| 2) |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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5808 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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_74| v_ArrVal_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))))) is different from false [2022-03-03 18:24:42,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5808 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| 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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5808 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse2 |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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5808 Int)) (= (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 (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|)))) (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_74| v_ArrVal_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) |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_74|)))) is different from false [2022-03-03 18:24:43,350 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-03 18:24:43,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692778757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:24:43,351 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:24:43,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:24:43,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762420794] [2022-03-03 18:24:43,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:24:43,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:24:43,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:24:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1182, Unknown=3, NotChecked=216, Total=1560 [2022-03-03 18:24:43,352 INFO L87 Difference]: Start difference. First operand 3480 states and 6854 transitions. Second operand has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:45,359 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 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|) (= |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 (+ .cse0 |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| .cse0) 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|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5808 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 (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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5808 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 (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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5808 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |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_74|)))) (<= (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-03 18:24:46,067 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_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) (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_5808 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| 2) |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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5808 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 (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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5808 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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |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_74| v_ArrVal_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))))) (<= 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 .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-03 18:24:46,731 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_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) (<= 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 .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5808 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_74| v_ArrVal_5808)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5808 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_74| v_ArrVal_5808)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5808 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_74| v_ArrVal_5808)) |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_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-03 18:24:49,300 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 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|) (= |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 (+ .cse0 |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| .cse0) 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|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5808 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 (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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5808 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 (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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5808 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |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|)))) (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_5808))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |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_74|)))) (<= (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-03 18:24:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:50,416 INFO L93 Difference]: Finished difference Result 12334 states and 24464 transitions. [2022-03-03 18:24:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-03 18:24:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 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-03 18:24:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:50,430 INFO L225 Difference]: With dead ends: 12334 [2022-03-03 18:24:50,430 INFO L226 Difference]: Without dead ends: 12328 [2022-03-03 18:24:50,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2372 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1360, Invalid=6851, Unknown=7, NotChecked=1288, Total=9506 [2022-03-03 18:24:50,431 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 1781 mSDsluCounter, 6628 mSDsCounter, 0 mSdLazyCounter, 5528 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 6998 SdHoareTripleChecker+Invalid, 8000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 5528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2378 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:50,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1781 Valid, 6998 Invalid, 8000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 5528 Invalid, 0 Unknown, 2378 Unchecked, 2.7s Time] [2022-03-03 18:24:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12328 states. [2022-03-03 18:24:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12328 to 3506. [2022-03-03 18:24:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3506 states, 3499 states have (on average 1.9737067733638183) internal successors, (6906), 3505 states have internal predecessors, (6906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 6906 transitions. [2022-03-03 18:24:50,495 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 6906 transitions. Word has length 134 [2022-03-03 18:24:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:50,496 INFO L470 AbstractCegarLoop]: Abstraction has 3506 states and 6906 transitions. [2022-03-03 18:24:50,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 6906 transitions. [2022-03-03 18:24:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:50,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:50,498 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-03 18:24:50,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-03 18:24:50,700 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-03 18:24:50,700 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-03 18:24:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash -467560269, now seen corresponding path program 6 times [2022-03-03 18:24:50,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:50,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952328895] [2022-03-03 18:24:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:50,974 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-03 18:24:50,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:50,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952328895] [2022-03-03 18:24:50,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952328895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:50,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554259016] [2022-03-03 18:24:50,974 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:24:50,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:50,976 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-03 18:24:50,976 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-03 18:24:51,350 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 18:24:51,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:51,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-03 18:24:51,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:52,084 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-03 18:24:52,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,126 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-03 18:24:52,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,211 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-03 18:24:52,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,263 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-03 18:24:52,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:52,385 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-03 18:24:52,445 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-03 18:24:52,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:10,566 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-03 18:25:11,871 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-03 18:25:11,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554259016] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:11,871 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:11,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-03 18:25:11,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373367365] [2022-03-03 18:25:11,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:11,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:25:11,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:25:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1381, Unknown=17, NotChecked=76, Total=1640 [2022-03-03 18:25:11,872 INFO L87 Difference]: Start difference. First operand 3506 states and 6906 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-03 18:25:16,001 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-03 18:25:20,517 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-03 18:25:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:21,644 INFO L93 Difference]: Finished difference Result 12525 states and 24846 transitions. [2022-03-03 18:25:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 18:25:21,645 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-03 18:25:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:21,660 INFO L225 Difference]: With dead ends: 12525 [2022-03-03 18:25:21,660 INFO L226 Difference]: Without dead ends: 12516 [2022-03-03 18:25:21,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=1066, Invalid=5727, Unknown=25, NotChecked=492, Total=7310 [2022-03-03 18:25:21,661 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 2540 mSDsluCounter, 5111 mSDsCounter, 0 mSdLazyCounter, 3607 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2540 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1434 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:21,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2540 Valid, 5512 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 3607 Invalid, 0 Unknown, 1434 Unchecked, 2.1s Time] [2022-03-03 18:25:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12516 states. [2022-03-03 18:25:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12516 to 3591. [2022-03-03 18:25:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3591 states, 3584 states have (on average 1.9743303571428572) internal successors, (7076), 3590 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 7076 transitions. [2022-03-03 18:25:21,727 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 7076 transitions. Word has length 134 [2022-03-03 18:25:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:21,728 INFO L470 AbstractCegarLoop]: Abstraction has 3591 states and 7076 transitions. [2022-03-03 18:25:21,728 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-03 18:25:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 7076 transitions. [2022-03-03 18:25:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:25:21,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:21,730 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-03 18:25:21,750 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-03 18:25:21,930 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-03 18:25:21,931 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-03 18:25:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 416790693, now seen corresponding path program 7 times [2022-03-03 18:25:21,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:21,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739817800] [2022-03-03 18:25:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:22,224 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-03 18:25:22,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:22,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739817800] [2022-03-03 18:25:22,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739817800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:22,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490313317] [2022-03-03 18:25:22,225 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:25:22,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:22,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:22,226 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-03 18:25:22,227 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-03 18:25:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:22,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-03 18:25:22,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:23,262 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-03 18:25:23,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,328 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-03 18:25:23,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,370 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-03 18:25:23,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,418 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-03 18:25:23,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:23,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 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-03 18:25:23,560 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-03 18:25:23,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:25,482 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-03 18:25:25,934 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-03 18:25:25,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490313317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:25,934 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:25,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-03 18:25:25,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839349356] [2022-03-03 18:25:25,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:25,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:25:25,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:25:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1385, Unknown=1, NotChecked=76, Total=1640 [2022-03-03 18:25:25,936 INFO L87 Difference]: Start difference. First operand 3591 states and 7076 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-03 18:25:27,725 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-03 18:25:30,400 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-03 18:25:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:32,751 INFO L93 Difference]: Finished difference Result 12497 states and 24787 transitions. [2022-03-03 18:25:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-03 18:25:32,752 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-03 18:25:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:32,770 INFO L225 Difference]: With dead ends: 12497 [2022-03-03 18:25:32,770 INFO L226 Difference]: Without dead ends: 12473 [2022-03-03 18:25:32,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1995, Invalid=10670, Unknown=3, NotChecked=672, Total=13340 [2022-03-03 18:25:32,787 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 2275 mSDsluCounter, 5203 mSDsCounter, 0 mSdLazyCounter, 4690 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2275 SdHoareTripleChecker+Valid, 5597 SdHoareTripleChecker+Invalid, 6685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 4690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1770 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:32,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2275 Valid, 5597 Invalid, 6685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 4690 Invalid, 0 Unknown, 1770 Unchecked, 2.3s Time] [2022-03-03 18:25:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12473 states. [2022-03-03 18:25:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12473 to 3620. [2022-03-03 18:25:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3613 states have (on average 1.9745363963465263) internal successors, (7134), 3619 states have internal predecessors, (7134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 7134 transitions. [2022-03-03 18:25:32,885 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 7134 transitions. Word has length 134 [2022-03-03 18:25:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:32,885 INFO L470 AbstractCegarLoop]: Abstraction has 3620 states and 7134 transitions. [2022-03-03 18:25:32,885 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-03 18:25:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 7134 transitions. [2022-03-03 18:25:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:25:32,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:32,888 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-03 18:25:32,907 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-03 18:25:33,088 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-03 18:25:33,088 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-03 18:25:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1462386007, now seen corresponding path program 2 times [2022-03-03 18:25:33,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:33,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123463238] [2022-03-03 18:25:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:33,474 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-03 18:25:33,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:33,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123463238] [2022-03-03 18:25:33,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123463238] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:33,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663916842] [2022-03-03 18:25:33,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:25:33,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:33,482 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-03 18:25:33,484 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-03 18:25:33,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 18:25:33,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:33,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-03 18:25:33,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:34,360 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-03 18:25:34,421 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-03 18:25:34,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,463 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-03 18:25:34,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,508 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-03 18:25:34,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,584 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-03 18:25:34,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,715 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-03 18:25:34,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,800 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-03 18:25:34,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,834 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-03 18:25:34,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,859 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-03 18:25:34,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:34,885 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-03 18:25:34,990 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-03 18:25:34,990 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-03 18:25:35,021 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-03 18:25:35,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:44,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:44,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:44,889 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-03 18:25:44,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:44,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:44,895 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-03 18:25:44,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:44,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:44,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:44,906 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-03 18:25:44,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:44,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:44,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-03 18:25:44,919 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-03 18:25:44,923 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-03 18:25:45,362 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-03 18:25:45,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663916842] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:45,362 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:45,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 46 [2022-03-03 18:25:45,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322736393] [2022-03-03 18:25:45,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:45,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-03 18:25:45,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-03 18:25:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1912, Unknown=4, NotChecked=0, Total=2162 [2022-03-03 18:25:45,364 INFO L87 Difference]: Start difference. First operand 3620 states and 7134 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-03 18:25:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:49,888 INFO L93 Difference]: Finished difference Result 8855 states and 17518 transitions. [2022-03-03 18:25:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-03 18:25:49,889 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-03 18:25:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:49,900 INFO L225 Difference]: With dead ends: 8855 [2022-03-03 18:25:49,900 INFO L226 Difference]: Without dead ends: 8855 [2022-03-03 18:25:49,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 247 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1681, Invalid=8215, Unknown=4, NotChecked=0, Total=9900 [2022-03-03 18:25:49,901 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 2219 mSDsluCounter, 5225 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 5605 SdHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1236 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:49,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2219 Valid, 5605 Invalid, 4164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2692 Invalid, 0 Unknown, 1236 Unchecked, 1.7s Time] [2022-03-03 18:25:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8855 states. [2022-03-03 18:25:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8855 to 3670. [2022-03-03 18:25:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3663 states have (on average 1.9748839748839748) internal successors, (7234), 3669 states have internal predecessors, (7234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 7234 transitions. [2022-03-03 18:25:49,963 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 7234 transitions. Word has length 134 [2022-03-03 18:25:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:49,963 INFO L470 AbstractCegarLoop]: Abstraction has 3670 states and 7234 transitions. [2022-03-03 18:25:49,963 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-03 18:25:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 7234 transitions. [2022-03-03 18:25:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:25:49,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:49,965 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-03 18:25:49,984 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-03 18:25:50,166 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-03 18:25:50,166 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-03 18:25:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash -165019217, now seen corresponding path program 3 times [2022-03-03 18:25:50,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:50,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109135778] [2022-03-03 18:25:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:50,578 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-03 18:25:50,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:50,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109135778] [2022-03-03 18:25:50,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109135778] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:50,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69966051] [2022-03-03 18:25:50,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:25:50,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:50,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:50,580 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-03 18:25:50,580 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-03 18:25:50,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 18:25:50,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:50,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-03 18:25:50,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:51,627 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-03 18:25:51,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,667 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-03 18:25:51,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,712 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-03 18:25:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,806 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-03 18:25:51,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,915 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-03 18:25:51,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,946 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-03 18:25:51,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,972 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-03 18:25:51,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,002 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-03 18:25:52,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:52,097 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-03 18:25:52,152 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-03 18:25:52,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:54,360 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)) (= (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) 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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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 0)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse1 |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|) .cse2)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse3 |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)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 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) 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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 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-03 18:25:55,807 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| 3))) (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) 0) .cse1 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)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (select (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse3 |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)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_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)) 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-03 18:26:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-03 18:26:08,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69966051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:26:08,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:26:08,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 42 [2022-03-03 18:26:08,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515174750] [2022-03-03 18:26:08,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:26:08,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-03 18:26:08,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:08,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-03 18:26:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1459, Unknown=9, NotChecked=158, Total=1806 [2022-03-03 18:26:08,880 INFO L87 Difference]: Start difference. First operand 3670 states and 7234 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-03 18:26:12,594 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_90| Int)) (or (and (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse1 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)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (select (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse3 |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)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_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)) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) (= (select .cse6 |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|) (= |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) (= (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 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-03 18:26:14,674 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |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_90| Int)) (or (and (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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) 0)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse1 |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| 1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 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)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 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) 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|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 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) 0)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse5 |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| 2)) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= 0 (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:26:18,786 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_90| Int)) (or (and (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse1 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)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (select (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse3 |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)) (forall ((v_ArrVal_6436 Int) (v_ArrVal_6434 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_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)) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) (= (select .cse6 |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|) (= |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) (= (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 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-03 18:26:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:20,414 INFO L93 Difference]: Finished difference Result 16911 states and 33676 transitions. [2022-03-03 18:26:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-03 18:26:20,414 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-03 18:26:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:20,435 INFO L225 Difference]: With dead ends: 16911 [2022-03-03 18:26:20,435 INFO L226 Difference]: Without dead ends: 16911 [2022-03-03 18:26:20,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 255 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3436 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=1681, Invalid=9457, Unknown=12, NotChecked=1060, Total=12210 [2022-03-03 18:26:20,436 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 2802 mSDsluCounter, 5260 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2802 SdHoareTripleChecker+Valid, 5622 SdHoareTripleChecker+Invalid, 6655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2510 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:20,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2802 Valid, 5622 Invalid, 6655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 3871 Invalid, 0 Unknown, 2510 Unchecked, 2.3s Time] [2022-03-03 18:26:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16911 states. [2022-03-03 18:26:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16911 to 3675. [2022-03-03 18:26:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 3668 states have (on average 1.974918211559433) internal successors, (7244), 3674 states have internal predecessors, (7244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 7244 transitions. [2022-03-03 18:26:20,526 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 7244 transitions. Word has length 134 [2022-03-03 18:26:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:20,527 INFO L470 AbstractCegarLoop]: Abstraction has 3675 states and 7244 transitions. [2022-03-03 18:26:20,527 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-03 18:26:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 7244 transitions. [2022-03-03 18:26:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:26:20,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:20,530 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-03 18:26:20,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-03 18:26:20,741 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-03 18:26:20,741 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-03 18:26:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -862930061, now seen corresponding path program 4 times [2022-03-03 18:26:20,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:20,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690691338] [2022-03-03 18:26:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:21,234 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-03 18:26:21,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:21,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690691338] [2022-03-03 18:26:21,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690691338] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:21,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615122707] [2022-03-03 18:26:21,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:26:21,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:21,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:21,236 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-03 18:26:21,237 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-03 18:26:22,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:26:22,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:26:22,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-03 18:26:22,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:22,743 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-03 18:26:22,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,783 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-03 18:26:22,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,830 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-03 18:26:22,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-03 18:26:22,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:22,999 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-03 18:26:23,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,058 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-03 18:26:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,091 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-03 18:26:23,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,117 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-03 18:26:23,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:23,279 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:26:23,279 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 10 case distinctions, treesize of input 62 treesize of output 73 [2022-03-03 18:26:29,370 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-03 18:26:29,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:50,767 INFO L353 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-03-03 18:26:50,768 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 6172 treesize of output 6187 [2022-03-03 18:26:50,951 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 18:26:50,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4590 treesize of output 4584 [2022-03-03 18:26:50,978 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-03 18:26:51,002 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-03 18:26:51,191 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-03 18:26:51,192 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-03 18:26:51,195 INFO L158 Benchmark]: Toolchain (without parser) took 319308.05ms. Allocated memory was 205.5MB in the beginning and 413.1MB in the end (delta: 207.6MB). Free memory was 152.7MB in the beginning and 241.4MB in the end (delta: -88.7MB). Peak memory consumption was 243.3MB. Max. memory is 8.0GB. [2022-03-03 18:26:51,195 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:26:51,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.56ms. Allocated memory is still 205.5MB. Free memory was 152.4MB in the beginning and 163.3MB in the end (delta: -10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-03 18:26:51,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.10ms. Allocated memory is still 205.5MB. Free memory was 162.8MB in the beginning and 160.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:26:51,195 INFO L158 Benchmark]: Boogie Preprocessor took 21.58ms. Allocated memory is still 205.5MB. Free memory was 160.7MB in the beginning and 158.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:26:51,195 INFO L158 Benchmark]: RCFGBuilder took 354.26ms. Allocated memory is still 205.5MB. Free memory was 158.6MB in the beginning and 143.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-03 18:26:51,195 INFO L158 Benchmark]: TraceAbstraction took 318434.64ms. Allocated memory was 205.5MB in the beginning and 413.1MB in the end (delta: 207.6MB). Free memory was 143.4MB in the beginning and 241.4MB in the end (delta: -98.0MB). Peak memory consumption was 234.9MB. Max. memory is 8.0GB. [2022-03-03 18:26:51,196 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.12ms. Allocated memory is still 205.5MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 460.56ms. Allocated memory is still 205.5MB. Free memory was 152.4MB in the beginning and 163.3MB in the end (delta: -10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.10ms. Allocated memory is still 205.5MB. Free memory was 162.8MB in the beginning and 160.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.58ms. Allocated memory is still 205.5MB. Free memory was 160.7MB in the beginning and 158.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.26ms. Allocated memory is still 205.5MB. Free memory was 158.6MB in the beginning and 143.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 318434.64ms. Allocated memory was 205.5MB in the beginning and 413.1MB in the end (delta: 207.6MB). Free memory was 143.4MB in the beginning and 241.4MB in the end (delta: -98.0MB). Peak memory consumption was 234.9MB. 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-03 18:26:51,403 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-03 18:26:51,438 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...