/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.abstract-por-f0ea240 [2022-02-10 23:42:47,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:42:47,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:42:47,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:42:47,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:42:47,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:42:47,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:42:47,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:42:47,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:42:47,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:42:47,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:42:47,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:42:47,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:42:47,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:42:47,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:42:47,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:42:47,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:42:47,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:42:47,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:42:47,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:42:47,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:42:47,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:42:47,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:42:47,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:42:47,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:42:47,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:42:47,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:42:47,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:42:47,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:42:47,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:42:47,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:42:47,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:42:47,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:42:47,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:42:47,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:42:47,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:42:47,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:42:47,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:42:47,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:42:47,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:42:47,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:42:47,996 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-02-10 23:42:48,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:42:48,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:42:48,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:42:48,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:42:48,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:42:48,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:42:48,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:42:48,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:42:48,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:42:48,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:42:48,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:42:48,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:42:48,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:42:48,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:42:48,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:42:48,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:42:48,021 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:42:48,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:42:48,021 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-02-10 23:42:48,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:42:48,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:42:48,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:42:48,198 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:42:48,198 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:42:48,199 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-02-10 23:42:48,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5013b6b56/5cb131035d704c759cca0571335d0505/FLAG725e4b9a6 [2022-02-10 23:42:48,642 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:42:48,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-02-10 23:42:48,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5013b6b56/5cb131035d704c759cca0571335d0505/FLAG725e4b9a6 [2022-02-10 23:42:48,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5013b6b56/5cb131035d704c759cca0571335d0505 [2022-02-10 23:42:48,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:42:48,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:42:48,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:42:48,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:42:48,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:42:48,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:42:48" (1/1) ... [2022-02-10 23:42:48,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1639bd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:48, skipping insertion in model container [2022-02-10 23:42:48,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:42:48" (1/1) ... [2022-02-10 23:42:48,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:42:48,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:42:49,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:42:49,021 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:42:49,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:42:49,105 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:42:49,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49 WrapperNode [2022-02-10 23:42:49,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:42:49,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:42:49,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:42:49,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:42:49,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,165 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-02-10 23:42:49,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:42:49,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:42:49,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:42:49,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:42:49,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:42:49,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:42:49,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:42:49,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:42:49,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (1/1) ... [2022-02-10 23:42:49,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:42:49,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:49,248 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-02-10 23:42:49,268 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-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 23:42:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-10 23:42:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-10 23:42:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:42:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:42:49,296 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:42:49,385 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:42:49,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:42:49,565 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:42:49,570 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:42:49,571 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-10 23:42:49,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:42:49 BoogieIcfgContainer [2022-02-10 23:42:49,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:42:49,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:42:49,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:42:49,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:42:49,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:42:48" (1/3) ... [2022-02-10 23:42:49,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7dc790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:42:49, skipping insertion in model container [2022-02-10 23:42:49,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:49" (2/3) ... [2022-02-10 23:42:49,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7dc790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:42:49, skipping insertion in model container [2022-02-10 23:42:49,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:42:49" (3/3) ... [2022-02-10 23:42:49,580 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-02-10 23:42:49,585 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:42:49,585 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:42:49,586 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-10 23:42:49,586 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:42:49,627 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,627 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,627 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,627 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,628 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,628 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,628 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,628 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,628 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,629 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,629 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,630 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,630 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,630 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,630 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,630 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,631 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,631 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,631 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,632 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,633 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,634 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,635 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,636 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,637 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,638 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,639 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,639 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,639 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,639 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,640 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,641 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,642 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,643 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,644 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,645 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,646 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,647 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,647 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,647 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,654 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,655 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,655 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,655 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,655 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,656 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,656 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,656 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,656 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,656 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,660 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,660 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,660 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,660 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,660 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,661 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,661 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,661 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,661 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,662 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,662 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,662 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,662 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,664 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:49,666 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 23:42:49,702 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:42:49,706 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, 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 [2022-02-10 23:42:49,706 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-10 23:42:49,716 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 106 transitions, 217 flow [2022-02-10 23:42:49,801 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-02-10 23:42:49,805 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-02-10 23:42:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-10 23:42:49,813 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:49,814 INFO L515 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-02-10 23:42:49,814 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-02-10 23:42:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1089390899, now seen corresponding path program 1 times [2022-02-10 23:42:49,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:49,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635107196] [2022-02-10 23:42:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:50,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:50,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635107196] [2022-02-10 23:42:50,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635107196] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:50,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:50,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:42:50,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990096574] [2022-02-10 23:42:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:50,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:42:50,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:42:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:42:50,035 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-02-10 23:42:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:50,074 INFO L93 Difference]: Finished difference Result 1519 states and 3016 transitions. [2022-02-10 23:42:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:42:50,076 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-02-10 23:42:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:50,101 INFO L225 Difference]: With dead ends: 1519 [2022-02-10 23:42:50,101 INFO L226 Difference]: Without dead ends: 1519 [2022-02-10 23:42:50,103 INFO L933 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-02-10 23:42:50,106 INFO L934 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-02-10 23:42:50,107 INFO L935 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-02-10 23:42:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-02-10 23:42:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2022-02-10 23:42:50,186 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-02-10 23:42:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3016 transitions. [2022-02-10 23:42:50,191 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3016 transitions. Word has length 35 [2022-02-10 23:42:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:50,192 INFO L470 AbstractCegarLoop]: Abstraction has 1519 states and 3016 transitions. [2022-02-10 23:42:50,193 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-02-10 23:42:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3016 transitions. [2022-02-10 23:42:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-10 23:42:50,200 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:50,201 INFO L515 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-02-10 23:42:50,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:42:50,202 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-02-10 23:42:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1960811916, now seen corresponding path program 1 times [2022-02-10 23:42:50,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:50,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254319731] [2022-02-10 23:42:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:50,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:50,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:50,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254319731] [2022-02-10 23:42:50,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254319731] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:50,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:50,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:42:50,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675304192] [2022-02-10 23:42:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:50,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:42:50,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:42:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:42:50,254 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-02-10 23:42:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:50,275 INFO L93 Difference]: Finished difference Result 1523 states and 3020 transitions. [2022-02-10 23:42:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:42:50,275 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-02-10 23:42:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:50,281 INFO L225 Difference]: With dead ends: 1523 [2022-02-10 23:42:50,281 INFO L226 Difference]: Without dead ends: 1523 [2022-02-10 23:42:50,282 INFO L933 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-02-10 23:42:50,283 INFO L934 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-02-10 23:42:50,283 INFO L935 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-02-10 23:42:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-02-10 23:42:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2022-02-10 23:42:50,333 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-02-10 23:42:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3017 transitions. [2022-02-10 23:42:50,338 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3017 transitions. Word has length 35 [2022-02-10 23:42:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:50,339 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 3017 transitions. [2022-02-10 23:42:50,340 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-02-10 23:42:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3017 transitions. [2022-02-10 23:42:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-10 23:42:50,342 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:50,342 INFO L515 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-02-10 23:42:50,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:42:50,342 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-02-10 23:42:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2113524451, now seen corresponding path program 1 times [2022-02-10 23:42:50,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:50,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807536089] [2022-02-10 23:42:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:50,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:50,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807536089] [2022-02-10 23:42:50,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807536089] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:50,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522688656] [2022-02-10 23:42:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:50,452 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-02-10 23:42:50,453 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-02-10 23:42:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:50,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 23:42:50,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:50,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:50,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522688656] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:50,745 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:50,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 23:42:50,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48336435] [2022-02-10 23:42:50,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:50,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:50,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:50,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:42:50,746 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-02-10 23:42:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:50,830 INFO L93 Difference]: Finished difference Result 1530 states and 3027 transitions. [2022-02-10 23:42:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:42:50,831 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-02-10 23:42:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:50,847 INFO L225 Difference]: With dead ends: 1530 [2022-02-10 23:42:50,847 INFO L226 Difference]: Without dead ends: 1530 [2022-02-10 23:42:50,847 INFO L933 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-02-10 23:42:50,848 INFO L934 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-02-10 23:42:50,848 INFO L935 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-02-10 23:42:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-02-10 23:42:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-02-10 23:42:50,879 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-02-10 23:42:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3027 transitions. [2022-02-10 23:42:50,883 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3027 transitions. Word has length 40 [2022-02-10 23:42:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:50,883 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 3027 transitions. [2022-02-10 23:42:50,883 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-02-10 23:42:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3027 transitions. [2022-02-10 23:42:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 23:42:50,884 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:50,884 INFO L515 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-02-10 23:42:50,903 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-02-10 23:42:51,102 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-02-10 23:42:51,103 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-02-10 23:42:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash 37547901, now seen corresponding path program 2 times [2022-02-10 23:42:51,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:51,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385316416] [2022-02-10 23:42:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:51,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:51,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385316416] [2022-02-10 23:42:51,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385316416] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:51,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280314722] [2022-02-10 23:42:51,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:42:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:51,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:51,182 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-02-10 23:42:51,214 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-02-10 23:42:51,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:42:51,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:51,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-10 23:42:51,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:51,354 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-02-10 23:42:51,381 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-10 23:42:51,382 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-02-10 23:42:51,426 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-10 23:42:51,427 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-02-10 23:42:51,496 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-10 23:42:51,496 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-02-10 23:42:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-10 23:42:51,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:51,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280314722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:51,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:51,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-10 23:42:51,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713939511] [2022-02-10 23:42:51,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:51,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:42:51,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:42:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:42:51,520 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-02-10 23:42:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:51,690 INFO L93 Difference]: Finished difference Result 1831 states and 3629 transitions. [2022-02-10 23:42:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:42:51,690 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-02-10 23:42:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:51,696 INFO L225 Difference]: With dead ends: 1831 [2022-02-10 23:42:51,696 INFO L226 Difference]: Without dead ends: 1831 [2022-02-10 23:42:51,697 INFO L933 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-02-10 23:42:51,697 INFO L934 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-02-10 23:42:51,698 INFO L935 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-02-10 23:42:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-02-10 23:42:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1679. [2022-02-10 23:42:51,723 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-02-10 23:42:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3325 transitions. [2022-02-10 23:42:51,727 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3325 transitions. Word has length 50 [2022-02-10 23:42:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:51,728 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3325 transitions. [2022-02-10 23:42:51,728 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-02-10 23:42:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3325 transitions. [2022-02-10 23:42:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 23:42:51,729 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:51,729 INFO L515 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-02-10 23:42:51,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-10 23:42:51,946 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-02-10 23:42:51,946 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-02-10 23:42:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1921653659, now seen corresponding path program 1 times [2022-02-10 23:42:51,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:51,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708445106] [2022-02-10 23:42:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:52,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:52,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708445106] [2022-02-10 23:42:52,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708445106] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:52,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134354507] [2022-02-10 23:42:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:52,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:52,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:52,037 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-02-10 23:42:52,069 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-02-10 23:42:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:52,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 23:42:52,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:52,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:52,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134354507] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:52,324 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:52,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-10 23:42:52,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206920432] [2022-02-10 23:42:52,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:52,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-10 23:42:52,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-10 23:42:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:42:52,325 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-02-10 23:42:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:52,465 INFO L93 Difference]: Finished difference Result 1699 states and 3345 transitions. [2022-02-10 23:42:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 23:42:52,466 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-02-10 23:42:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:52,471 INFO L225 Difference]: With dead ends: 1699 [2022-02-10 23:42:52,471 INFO L226 Difference]: Without dead ends: 1699 [2022-02-10 23:42:52,471 INFO L933 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-02-10 23:42:52,472 INFO L934 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-02-10 23:42:52,472 INFO L935 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-02-10 23:42:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-02-10 23:42:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2022-02-10 23:42:52,497 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-02-10 23:42:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3345 transitions. [2022-02-10 23:42:52,500 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3345 transitions. Word has length 50 [2022-02-10 23:42:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:52,500 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 3345 transitions. [2022-02-10 23:42:52,500 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-02-10 23:42:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3345 transitions. [2022-02-10 23:42:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-10 23:42:52,501 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:52,501 INFO L515 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-02-10 23:42:52,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-10 23:42:52,718 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-02-10 23:42:52,718 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-02-10 23:42:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1189660581, now seen corresponding path program 2 times [2022-02-10 23:42:52,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:52,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862670147] [2022-02-10 23:42:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:52,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:52,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862670147] [2022-02-10 23:42:52,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862670147] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:52,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211404826] [2022-02-10 23:42:52,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:42:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:52,876 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-02-10 23:42:52,881 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-02-10 23:42:52,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:42:52,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:52,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-10 23:42:52,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:53,041 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-02-10 23:42:53,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-10 23:42:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,086 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:42:53,086 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-02-10 23:42:53,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:53,120 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:42:53,120 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-02-10 23:42:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-10 23:42:53,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:53,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211404826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:53,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:53,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-02-10 23:42:53,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859862185] [2022-02-10 23:42:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:53,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:53,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-02-10 23:42:53,145 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-02-10 23:42:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:53,512 INFO L93 Difference]: Finished difference Result 3571 states and 7089 transitions. [2022-02-10 23:42:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:42:53,512 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-02-10 23:42:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:53,523 INFO L225 Difference]: With dead ends: 3571 [2022-02-10 23:42:53,523 INFO L226 Difference]: Without dead ends: 3571 [2022-02-10 23:42:53,524 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-02-10 23:42:53,524 INFO L934 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-02-10 23:42:53,524 INFO L935 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-02-10 23:42:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-02-10 23:42:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2167. [2022-02-10 23:42:53,595 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-02-10 23:42:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4281 transitions. [2022-02-10 23:42:53,599 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4281 transitions. Word has length 70 [2022-02-10 23:42:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:53,600 INFO L470 AbstractCegarLoop]: Abstraction has 2167 states and 4281 transitions. [2022-02-10 23:42:53,600 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-02-10 23:42:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4281 transitions. [2022-02-10 23:42:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-10 23:42:53,601 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:53,601 INFO L515 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-02-10 23:42:53,618 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-02-10 23:42:53,818 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-02-10 23:42:53,818 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-02-10 23:42:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:53,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1998481730, now seen corresponding path program 1 times [2022-02-10 23:42:53,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:53,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439226415] [2022-02-10 23:42:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:53,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:53,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:53,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439226415] [2022-02-10 23:42:53,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439226415] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:53,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718201418] [2022-02-10 23:42:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:53,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:53,941 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-02-10 23:42:53,967 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-02-10 23:42:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:54,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-10 23:42:54,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:54,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:54,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718201418] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:54,299 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:54,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-10 23:42:54,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335318628] [2022-02-10 23:42:54,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:54,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-10 23:42:54,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-10 23:42:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:42:54,304 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-02-10 23:42:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:54,513 INFO L93 Difference]: Finished difference Result 2182 states and 4296 transitions. [2022-02-10 23:42:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 23:42:54,514 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-02-10 23:42:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:54,520 INFO L225 Difference]: With dead ends: 2182 [2022-02-10 23:42:54,520 INFO L226 Difference]: Without dead ends: 2182 [2022-02-10 23:42:54,521 INFO L933 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-02-10 23:42:54,521 INFO L934 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-02-10 23:42:54,522 INFO L935 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-02-10 23:42:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2022-02-10 23:42:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2022-02-10 23:42:54,550 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-02-10 23:42:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 4296 transitions. [2022-02-10 23:42:54,554 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 4296 transitions. Word has length 78 [2022-02-10 23:42:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:54,555 INFO L470 AbstractCegarLoop]: Abstraction has 2182 states and 4296 transitions. [2022-02-10 23:42:54,555 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-02-10 23:42:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 4296 transitions. [2022-02-10 23:42:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-10 23:42:54,556 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:54,556 INFO L515 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-02-10 23:42:54,575 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-02-10 23:42:54,770 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-02-10 23:42:54,770 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-02-10 23:42:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash 920350873, now seen corresponding path program 2 times [2022-02-10 23:42:54,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:54,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177232719] [2022-02-10 23:42:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:42:54,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:54,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177232719] [2022-02-10 23:42:54,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177232719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:54,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:54,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:42:54,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005696342] [2022-02-10 23:42:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:54,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:42:54,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:54,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:42:54,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:42:54,852 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-02-10 23:42:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:54,942 INFO L93 Difference]: Finished difference Result 2448 states and 4828 transitions. [2022-02-10 23:42:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:42:54,942 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-02-10 23:42:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:54,948 INFO L225 Difference]: With dead ends: 2448 [2022-02-10 23:42:54,949 INFO L226 Difference]: Without dead ends: 2203 [2022-02-10 23:42:54,949 INFO L933 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-02-10 23:42:54,949 INFO L934 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-02-10 23:42:54,949 INFO L935 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-02-10 23:42:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-02-10 23:42:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2098. [2022-02-10 23:42:54,978 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-02-10 23:42:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4114 transitions. [2022-02-10 23:42:54,982 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4114 transitions. Word has length 93 [2022-02-10 23:42:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:54,982 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 4114 transitions. [2022-02-10 23:42:54,982 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-02-10 23:42:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4114 transitions. [2022-02-10 23:42:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-10 23:42:54,983 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:54,983 INFO L515 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-02-10 23:42:54,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 23:42:54,983 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-02-10 23:42:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1018614855, now seen corresponding path program 1 times [2022-02-10 23:42:54,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:54,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814690736] [2022-02-10 23:42:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:42:55,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:55,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814690736] [2022-02-10 23:42:55,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814690736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:55,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:55,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:42:55,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798191795] [2022-02-10 23:42:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:55,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:42:55,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:55,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:42:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:42:55,098 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-02-10 23:42:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:55,213 INFO L93 Difference]: Finished difference Result 2349 states and 4616 transitions. [2022-02-10 23:42:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:42:55,213 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-02-10 23:42:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:55,220 INFO L225 Difference]: With dead ends: 2349 [2022-02-10 23:42:55,220 INFO L226 Difference]: Without dead ends: 2349 [2022-02-10 23:42:55,220 INFO L933 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-02-10 23:42:55,221 INFO L934 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-02-10 23:42:55,221 INFO L935 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-02-10 23:42:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-02-10 23:42:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2229. [2022-02-10 23:42:55,251 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-02-10 23:42:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4376 transitions. [2022-02-10 23:42:55,255 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4376 transitions. Word has length 93 [2022-02-10 23:42:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:55,256 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 4376 transitions. [2022-02-10 23:42:55,256 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-02-10 23:42:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4376 transitions. [2022-02-10 23:42:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:42:55,257 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:55,257 INFO L515 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-02-10 23:42:55,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 23:42:55,258 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-02-10 23:42:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1317609396, now seen corresponding path program 1 times [2022-02-10 23:42:55,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:55,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504363190] [2022-02-10 23:42:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:42:55,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:55,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504363190] [2022-02-10 23:42:55,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504363190] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:55,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257373627] [2022-02-10 23:42:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:55,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:55,396 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-02-10 23:42:55,396 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-02-10 23:42:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:42:55,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:55,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-02-10 23:42:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:42:55,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:55,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257373627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:55,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:55,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:42:55,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301090058] [2022-02-10 23:42:55,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:55,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:55,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:55,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:55,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:42:55,794 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-02-10 23:42:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:56,199 INFO L93 Difference]: Finished difference Result 6535 states and 12955 transitions. [2022-02-10 23:42:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:42:56,199 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-02-10 23:42:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:56,217 INFO L225 Difference]: With dead ends: 6535 [2022-02-10 23:42:56,217 INFO L226 Difference]: Without dead ends: 6535 [2022-02-10 23:42:56,217 INFO L933 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-02-10 23:42:56,218 INFO L934 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-02-10 23:42:56,218 INFO L935 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-02-10 23:42:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-02-10 23:42:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 2407. [2022-02-10 23:42:56,289 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-02-10 23:42:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4713 transitions. [2022-02-10 23:42:56,295 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4713 transitions. Word has length 105 [2022-02-10 23:42:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:56,295 INFO L470 AbstractCegarLoop]: Abstraction has 2407 states and 4713 transitions. [2022-02-10 23:42:56,295 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-02-10 23:42:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4713 transitions. [2022-02-10 23:42:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:42:56,297 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:56,297 INFO L515 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-02-10 23:42:56,318 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-02-10 23:42:56,511 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-02-10 23:42:56,511 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-02-10 23:42:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1330543596, now seen corresponding path program 2 times [2022-02-10 23:42:56,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:56,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682397076] [2022-02-10 23:42:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:42:56,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:56,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682397076] [2022-02-10 23:42:56,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682397076] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:56,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583586023] [2022-02-10 23:42:56,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:42:56,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:56,660 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-02-10 23:42:56,663 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-02-10 23:42:56,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:42:56,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:56,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:42:56,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:57,028 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-02-10 23:42:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:42:57,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:57,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583586023] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:57,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:57,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:42:57,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936711870] [2022-02-10 23:42:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:57,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:57,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:42:57,090 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-02-10 23:42:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:57,985 INFO L93 Difference]: Finished difference Result 5977 states and 11801 transitions. [2022-02-10 23:42:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:42:57,985 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-02-10 23:42:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:57,995 INFO L225 Difference]: With dead ends: 5977 [2022-02-10 23:42:57,995 INFO L226 Difference]: Without dead ends: 5977 [2022-02-10 23:42:57,996 INFO L933 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-02-10 23:42:57,996 INFO L934 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-02-10 23:42:57,996 INFO L935 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-02-10 23:42:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2022-02-10 23:42:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 2486. [2022-02-10 23:42:58,041 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-02-10 23:42:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4852 transitions. [2022-02-10 23:42:58,045 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4852 transitions. Word has length 105 [2022-02-10 23:42:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:58,045 INFO L470 AbstractCegarLoop]: Abstraction has 2486 states and 4852 transitions. [2022-02-10 23:42:58,045 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-02-10 23:42:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4852 transitions. [2022-02-10 23:42:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:42:58,047 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:58,047 INFO L515 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-02-10 23:42:58,067 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-02-10 23:42:58,263 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-02-10 23:42:58,264 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-02-10 23:42:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -103262266, now seen corresponding path program 3 times [2022-02-10 23:42:58,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:58,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535485923] [2022-02-10 23:42:58,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:42:58,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:58,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535485923] [2022-02-10 23:42:58,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535485923] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:58,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900383867] [2022-02-10 23:42:58,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:42:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:58,394 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-02-10 23:42:58,395 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-02-10 23:42:58,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:42:58,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:58,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:42:58,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:58,681 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-02-10 23:42:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:42:58,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:58,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900383867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:58,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:58,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:42:58,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143573969] [2022-02-10 23:42:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:58,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:58,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:42:58,762 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-02-10 23:42:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:59,135 INFO L93 Difference]: Finished difference Result 6280 states and 12407 transitions. [2022-02-10 23:42:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:42:59,136 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-02-10 23:42:59,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:59,146 INFO L225 Difference]: With dead ends: 6280 [2022-02-10 23:42:59,146 INFO L226 Difference]: Without dead ends: 6280 [2022-02-10 23:42:59,146 INFO L933 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-02-10 23:42:59,147 INFO L934 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.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:59,147 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 1457 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:42:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2022-02-10 23:42:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 2495. [2022-02-10 23:42:59,198 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-02-10 23:42:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4870 transitions. [2022-02-10 23:42:59,202 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4870 transitions. Word has length 105 [2022-02-10 23:42:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:59,202 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4870 transitions. [2022-02-10 23:42:59,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-02-10 23:42:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4870 transitions. [2022-02-10 23:42:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:42:59,204 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:59,204 INFO L515 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-02-10 23:42:59,247 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-02-10 23:42:59,419 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-02-10 23:42:59,421 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-02-10 23:42:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1750076570, now seen corresponding path program 4 times [2022-02-10 23:42:59,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:59,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193624214] [2022-02-10 23:42:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:42:59,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:59,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193624214] [2022-02-10 23:42:59,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193624214] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:59,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501269345] [2022-02-10 23:42:59,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:42:59,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:59,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:59,799 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-02-10 23:42:59,800 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-02-10 23:42:59,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:42:59,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:59,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-10 23:42:59,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:00,223 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-02-10 23:43:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:00,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:00,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501269345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:00,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:00,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:00,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676571481] [2022-02-10 23:43:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:00,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:00,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:00,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:00,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:00,295 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-02-10 23:43:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:01,231 INFO L93 Difference]: Finished difference Result 7583 states and 14975 transitions. [2022-02-10 23:43:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:01,235 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-02-10 23:43:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:01,249 INFO L225 Difference]: With dead ends: 7583 [2022-02-10 23:43:01,249 INFO L226 Difference]: Without dead ends: 7583 [2022-02-10 23:43:01,250 INFO L933 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-02-10 23:43:01,251 INFO L934 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-02-10 23:43:01,251 INFO L935 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-02-10 23:43:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-02-10 23:43:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 2492. [2022-02-10 23:43:01,315 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-02-10 23:43:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4864 transitions. [2022-02-10 23:43:01,320 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4864 transitions. Word has length 105 [2022-02-10 23:43:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:01,321 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 4864 transitions. [2022-02-10 23:43:01,321 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-02-10 23:43:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4864 transitions. [2022-02-10 23:43:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:01,323 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:01,323 INFO L515 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-02-10 23:43:01,353 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-02-10 23:43:01,540 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-02-10 23:43:01,540 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-02-10 23:43:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash 412316490, now seen corresponding path program 5 times [2022-02-10 23:43:01,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:01,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612175691] [2022-02-10 23:43:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:01,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:01,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612175691] [2022-02-10 23:43:01,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612175691] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:01,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71375256] [2022-02-10 23:43:01,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:01,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:01,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:01,871 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-02-10 23:43:01,883 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-02-10 23:43:01,998 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:01,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:01,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:02,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:02,306 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-02-10 23:43:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:02,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:02,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71375256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:02,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:02,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:02,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512265882] [2022-02-10 23:43:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:02,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:02,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:02,385 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-02-10 23:43:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:03,365 INFO L93 Difference]: Finished difference Result 7733 states and 15280 transitions. [2022-02-10 23:43:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-10 23:43:03,365 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-02-10 23:43:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:03,377 INFO L225 Difference]: With dead ends: 7733 [2022-02-10 23:43:03,378 INFO L226 Difference]: Without dead ends: 7733 [2022-02-10 23:43:03,378 INFO L933 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-02-10 23:43:03,379 INFO L934 BasicCegarLoop]: 272 mSDtfsCounter, 1165 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:03,379 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 1515 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2022-02-10 23:43:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 2496. [2022-02-10 23:43:03,436 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-02-10 23:43:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4872 transitions. [2022-02-10 23:43:03,439 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4872 transitions. Word has length 105 [2022-02-10 23:43:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:03,439 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 4872 transitions. [2022-02-10 23:43:03,439 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-02-10 23:43:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4872 transitions. [2022-02-10 23:43:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:03,441 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:03,441 INFO L515 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-02-10 23:43:03,483 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-02-10 23:43:03,658 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-02-10 23:43:03,659 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-02-10 23:43:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:03,659 INFO L85 PathProgramCache]: Analyzing trace with hash -155675980, now seen corresponding path program 6 times [2022-02-10 23:43:03,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:03,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437212489] [2022-02-10 23:43:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:03,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:03,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437212489] [2022-02-10 23:43:03,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437212489] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:03,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138499325] [2022-02-10 23:43:03,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:03,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:03,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:03,784 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-02-10 23:43:03,810 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-02-10 23:43:03,884 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:03,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:03,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:03,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:04,102 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-02-10 23:43:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:04,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:04,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138499325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:04,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:04,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:04,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362874787] [2022-02-10 23:43:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:04,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:04,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:04,194 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-02-10 23:43:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:04,744 INFO L93 Difference]: Finished difference Result 6177 states and 12187 transitions. [2022-02-10 23:43:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-10 23:43:04,745 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-02-10 23:43:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:04,752 INFO L225 Difference]: With dead ends: 6177 [2022-02-10 23:43:04,753 INFO L226 Difference]: Without dead ends: 6177 [2022-02-10 23:43:04,753 INFO L933 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-02-10 23:43:04,753 INFO L934 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.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:04,754 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 1401 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2022-02-10 23:43:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 2536. [2022-02-10 23:43:04,799 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-02-10 23:43:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-02-10 23:43:04,803 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-02-10 23:43:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:04,803 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-02-10 23:43:04,803 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-02-10 23:43:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-02-10 23:43:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:04,805 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:04,805 INFO L515 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-02-10 23:43:04,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-10 23:43:05,019 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-02-10 23:43:05,019 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-02-10 23:43:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1295126466, now seen corresponding path program 7 times [2022-02-10 23:43:05,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:05,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486149871] [2022-02-10 23:43:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:05,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:05,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-02-10 23:43:05,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:05,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486149871] [2022-02-10 23:43:05,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486149871] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:05,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834016986] [2022-02-10 23:43:05,130 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:05,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:05,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:05,131 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-02-10 23:43:05,159 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-02-10 23:43:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:05,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:05,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:05,496 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-02-10 23:43:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:05,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:05,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834016986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:05,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:05,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:05,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731163100] [2022-02-10 23:43:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:05,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:05,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:05,563 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-02-10 23:43:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:06,413 INFO L93 Difference]: Finished difference Result 6219 states and 12247 transitions. [2022-02-10 23:43:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:06,413 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-02-10 23:43:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:06,420 INFO L225 Difference]: With dead ends: 6219 [2022-02-10 23:43:06,420 INFO L226 Difference]: Without dead ends: 6219 [2022-02-10 23:43:06,421 INFO L933 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-02-10 23:43:06,421 INFO L934 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-02-10 23:43:06,421 INFO L935 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-02-10 23:43:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2022-02-10 23:43:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 2536. [2022-02-10 23:43:06,501 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-02-10 23:43:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-02-10 23:43:06,507 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-02-10 23:43:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:06,508 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-02-10 23:43:06,509 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-02-10 23:43:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-02-10 23:43:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:06,515 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:06,515 INFO L515 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-02-10 23:43:06,534 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-02-10 23:43:06,731 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-02-10 23:43:06,732 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-02-10 23:43:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2095944408, now seen corresponding path program 8 times [2022-02-10 23:43:06,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:06,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119065490] [2022-02-10 23:43:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:06,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:06,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119065490] [2022-02-10 23:43:06,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119065490] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:06,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48192857] [2022-02-10 23:43:06,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:06,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:06,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:06,974 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-02-10 23:43:07,000 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-02-10 23:43:07,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:07,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:07,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:07,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:07,275 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-02-10 23:43:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:07,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:07,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48192857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:07,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:07,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:07,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460385386] [2022-02-10 23:43:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:07,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:07,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:07,356 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-02-10 23:43:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:07,706 INFO L93 Difference]: Finished difference Result 5867 states and 11581 transitions. [2022-02-10 23:43:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:07,706 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-02-10 23:43:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:07,714 INFO L225 Difference]: With dead ends: 5867 [2022-02-10 23:43:07,714 INFO L226 Difference]: Without dead ends: 5867 [2022-02-10 23:43:07,714 INFO L933 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-02-10 23:43:07,715 INFO L934 BasicCegarLoop]: 247 mSDtfsCounter, 611 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:07,715 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1284 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2022-02-10 23:43:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 2554. [2022-02-10 23:43:07,759 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-02-10 23:43:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-02-10 23:43:07,762 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-02-10 23:43:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:07,763 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-02-10 23:43:07,763 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-02-10 23:43:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-02-10 23:43:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:07,765 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:07,765 INFO L515 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-02-10 23:43:07,794 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-02-10 23:43:07,979 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-02-10 23:43:07,979 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-02-10 23:43:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash 552208584, now seen corresponding path program 9 times [2022-02-10 23:43:07,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:07,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439653707] [2022-02-10 23:43:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:08,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:08,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439653707] [2022-02-10 23:43:08,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439653707] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:08,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599274225] [2022-02-10 23:43:08,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:08,174 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-02-10 23:43:08,175 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-02-10 23:43:08,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:08,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:08,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:08,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:08,498 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-02-10 23:43:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:08,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:08,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599274225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:08,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:08,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:08,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620835341] [2022-02-10 23:43:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:08,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:08,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:08,570 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-02-10 23:43:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:09,378 INFO L93 Difference]: Finished difference Result 7170 states and 14149 transitions. [2022-02-10 23:43:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 23:43:09,378 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-02-10 23:43:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:09,387 INFO L225 Difference]: With dead ends: 7170 [2022-02-10 23:43:09,387 INFO L226 Difference]: Without dead ends: 7170 [2022-02-10 23:43:09,388 INFO L933 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-02-10 23:43:09,388 INFO L934 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-02-10 23:43:09,388 INFO L935 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-02-10 23:43:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2022-02-10 23:43:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 2551. [2022-02-10 23:43:09,431 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-02-10 23:43:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-02-10 23:43:09,434 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-02-10 23:43:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:09,434 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-02-10 23:43:09,434 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-02-10 23:43:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-02-10 23:43:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:09,436 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:09,436 INFO L515 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-02-10 23:43:09,463 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-02-10 23:43:09,651 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-02-10 23:43:09,651 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-02-10 23:43:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:09,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1580365652, now seen corresponding path program 10 times [2022-02-10 23:43:09,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:09,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148363568] [2022-02-10 23:43:09,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:09,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:09,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148363568] [2022-02-10 23:43:09,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148363568] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:09,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722987199] [2022-02-10 23:43:09,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:09,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:09,756 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-02-10 23:43:09,757 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-02-10 23:43:09,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:09,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:09,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:43:09,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:10,107 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-02-10 23:43:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:10,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:10,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722987199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:10,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:10,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-02-10 23:43:10,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521289938] [2022-02-10 23:43:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:10,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:43:10,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:43:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:10,144 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-02-10 23:43:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:10,946 INFO L93 Difference]: Finished difference Result 9974 states and 19724 transitions. [2022-02-10 23:43:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-10 23:43:10,947 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-02-10 23:43:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:10,959 INFO L225 Difference]: With dead ends: 9974 [2022-02-10 23:43:10,960 INFO L226 Difference]: Without dead ends: 9974 [2022-02-10 23:43:10,960 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 23:43:10,961 INFO L934 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-02-10 23:43:10,961 INFO L935 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-02-10 23:43:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2022-02-10 23:43:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 2555. [2022-02-10 23:43:11,033 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-02-10 23:43:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-02-10 23:43:11,036 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-02-10 23:43:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:11,036 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-02-10 23:43:11,036 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-02-10 23:43:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-02-10 23:43:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:11,038 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:11,038 INFO L515 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-02-10 23:43:11,055 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-02-10 23:43:11,255 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-02-10 23:43:11,256 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-02-10 23:43:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2146609174, now seen corresponding path program 11 times [2022-02-10 23:43:11,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:11,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205408021] [2022-02-10 23:43:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:11,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:11,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205408021] [2022-02-10 23:43:11,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205408021] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:11,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720627353] [2022-02-10 23:43:11,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:11,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:11,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:11,517 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-02-10 23:43:11,518 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-02-10 23:43:11,647 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:11,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:11,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:11,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:11,901 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-02-10 23:43:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:11,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:11,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720627353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:11,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:11,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:11,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051998446] [2022-02-10 23:43:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:11,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:11,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:11,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:11,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:11,994 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-02-10 23:43:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:12,526 INFO L93 Difference]: Finished difference Result 7437 states and 14669 transitions. [2022-02-10 23:43:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:43:12,526 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-02-10 23:43:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:12,535 INFO L225 Difference]: With dead ends: 7437 [2022-02-10 23:43:12,535 INFO L226 Difference]: Without dead ends: 7437 [2022-02-10 23:43:12,536 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 23:43:12,536 INFO L934 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-02-10 23:43:12,536 INFO L935 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-02-10 23:43:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2022-02-10 23:43:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 2557. [2022-02-10 23:43:12,584 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-02-10 23:43:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-02-10 23:43:12,587 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-02-10 23:43:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:12,587 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-02-10 23:43:12,587 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-02-10 23:43:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-02-10 23:43:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:12,589 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:12,589 INFO L515 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-02-10 23:43:12,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:12,801 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-02-10 23:43:12,801 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-02-10 23:43:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -697555676, now seen corresponding path program 12 times [2022-02-10 23:43:12,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:12,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917946078] [2022-02-10 23:43:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:13,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:13,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917946078] [2022-02-10 23:43:13,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917946078] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:13,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328916871] [2022-02-10 23:43:13,108 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:13,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:13,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:13,109 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-02-10 23:43:13,115 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-02-10 23:43:13,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:13,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:13,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:13,472 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-02-10 23:43:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:13,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:13,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328916871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:13,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:13,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:13,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510655415] [2022-02-10 23:43:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:13,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:13,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:13,537 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-02-10 23:43:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:14,401 INFO L93 Difference]: Finished difference Result 7479 states and 14729 transitions. [2022-02-10 23:43:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-10 23:43:14,401 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-02-10 23:43:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:14,410 INFO L225 Difference]: With dead ends: 7479 [2022-02-10 23:43:14,410 INFO L226 Difference]: Without dead ends: 7479 [2022-02-10 23:43:14,410 INFO L933 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-02-10 23:43:14,411 INFO L934 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-02-10 23:43:14,411 INFO L935 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-02-10 23:43:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2022-02-10 23:43:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 2545. [2022-02-10 23:43:14,455 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-02-10 23:43:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4970 transitions. [2022-02-10 23:43:14,458 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4970 transitions. Word has length 105 [2022-02-10 23:43:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:14,458 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 4970 transitions. [2022-02-10 23:43:14,458 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-02-10 23:43:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4970 transitions. [2022-02-10 23:43:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:14,460 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:14,460 INFO L515 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-02-10 23:43:14,493 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-02-10 23:43:14,691 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-02-10 23:43:14,691 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-02-10 23:43:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash 703468234, now seen corresponding path program 13 times [2022-02-10 23:43:14,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:14,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539281963] [2022-02-10 23:43:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:15,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:15,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539281963] [2022-02-10 23:43:15,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539281963] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:15,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365932271] [2022-02-10 23:43:15,003 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:15,015 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-02-10 23:43:15,017 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-02-10 23:43:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:15,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:15,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:15,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-02-10 23:43:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:15,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:15,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365932271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:15,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:15,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:15,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125894395] [2022-02-10 23:43:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:15,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:15,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:15,504 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-02-10 23:43:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:16,294 INFO L93 Difference]: Finished difference Result 7306 states and 14426 transitions. [2022-02-10 23:43:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 23:43:16,294 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-02-10 23:43:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:16,302 INFO L225 Difference]: With dead ends: 7306 [2022-02-10 23:43:16,302 INFO L226 Difference]: Without dead ends: 7306 [2022-02-10 23:43:16,303 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2022-02-10 23:43:16,303 INFO L934 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.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:16,304 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1363 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-02-10 23:43:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 2555. [2022-02-10 23:43:16,341 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-02-10 23:43:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-02-10 23:43:16,344 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-02-10 23:43:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:16,344 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-02-10 23:43:16,344 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-02-10 23:43:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-02-10 23:43:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:16,346 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:16,346 INFO L515 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-02-10 23:43:16,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-02-10 23:43:16,562 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-02-10 23:43:16,563 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-02-10 23:43:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 135475764, now seen corresponding path program 14 times [2022-02-10 23:43:16,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:16,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858208834] [2022-02-10 23:43:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:16,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:16,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858208834] [2022-02-10 23:43:16,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858208834] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:16,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437504190] [2022-02-10 23:43:16,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:16,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:16,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:16,851 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-02-10 23:43:16,855 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-02-10 23:43:16,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:16,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:16,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:17,191 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-02-10 23:43:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:17,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:17,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437504190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:17,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:17,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:17,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610707354] [2022-02-10 23:43:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:17,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:17,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:17,294 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-02-10 23:43:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:17,819 INFO L93 Difference]: Finished difference Result 7627 states and 15035 transitions. [2022-02-10 23:43:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:43:17,819 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-02-10 23:43:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:17,827 INFO L225 Difference]: With dead ends: 7627 [2022-02-10 23:43:17,828 INFO L226 Difference]: Without dead ends: 7627 [2022-02-10 23:43:17,828 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 23:43:17,828 INFO L934 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.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:17,828 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1427 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2022-02-10 23:43:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 2557. [2022-02-10 23:43:17,866 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-02-10 23:43:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-02-10 23:43:17,868 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-02-10 23:43:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:17,868 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-02-10 23:43:17,868 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-02-10 23:43:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-02-10 23:43:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:17,870 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:17,870 INFO L515 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-02-10 23:43:17,887 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-02-10 23:43:18,087 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-02-10 23:43:18,087 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-02-10 23:43:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1586278210, now seen corresponding path program 15 times [2022-02-10 23:43:18,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:18,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448846507] [2022-02-10 23:43:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:18,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:18,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448846507] [2022-02-10 23:43:18,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448846507] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:18,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328271894] [2022-02-10 23:43:18,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:18,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:18,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:18,339 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-02-10 23:43:18,340 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-02-10 23:43:18,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:18,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:18,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:18,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:18,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-10 23:43:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:18,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:18,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328271894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:18,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:18,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:18,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692182042] [2022-02-10 23:43:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:18,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:18,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:18,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:18,763 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-02-10 23:43:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:19,592 INFO L93 Difference]: Finished difference Result 7669 states and 15095 transitions. [2022-02-10 23:43:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 23:43:19,592 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-02-10 23:43:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:19,603 INFO L225 Difference]: With dead ends: 7669 [2022-02-10 23:43:19,603 INFO L226 Difference]: Without dead ends: 7669 [2022-02-10 23:43:19,604 INFO L933 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-02-10 23:43:19,604 INFO L934 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-02-10 23:43:19,604 INFO L935 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-02-10 23:43:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-02-10 23:43:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 2551. [2022-02-10 23:43:19,665 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-02-10 23:43:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-02-10 23:43:19,668 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-02-10 23:43:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:19,668 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-02-10 23:43:19,668 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-02-10 23:43:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-02-10 23:43:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:19,670 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:19,670 INFO L515 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-02-10 23:43:19,689 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-02-10 23:43:19,876 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-02-10 23:43:19,876 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-02-10 23:43:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -27754878, now seen corresponding path program 16 times [2022-02-10 23:43:19,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:19,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946550816] [2022-02-10 23:43:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:20,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:20,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946550816] [2022-02-10 23:43:20,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946550816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:20,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903405381] [2022-02-10 23:43:20,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:20,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:20,042 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-02-10 23:43:20,047 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-02-10 23:43:20,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:20,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:20,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-10 23:43:20,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:20,461 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-02-10 23:43:20,572 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-02-10 23:43:20,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,599 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-02-10 23:43:20,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,633 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-02-10 23:43:20,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:20,675 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-02-10 23:43:20,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:43:20,719 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-02-10 23:43:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:20,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:20,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903405381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:20,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:20,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2022-02-10 23:43:20,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003485649] [2022-02-10 23:43:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:20,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-10 23:43:20,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-10 23:43:20,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-02-10 23:43:20,729 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-02-10 23:43:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:21,351 INFO L93 Difference]: Finished difference Result 6873 states and 13572 transitions. [2022-02-10 23:43:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:21,351 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-02-10 23:43:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:21,359 INFO L225 Difference]: With dead ends: 6873 [2022-02-10 23:43:21,359 INFO L226 Difference]: Without dead ends: 6873 [2022-02-10 23:43:21,359 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=922, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 23:43:21,360 INFO L934 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-02-10 23:43:21,360 INFO L935 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-02-10 23:43:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2022-02-10 23:43:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 2556. [2022-02-10 23:43:21,397 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-02-10 23:43:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4992 transitions. [2022-02-10 23:43:21,400 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4992 transitions. Word has length 105 [2022-02-10 23:43:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:21,400 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 4992 transitions. [2022-02-10 23:43:21,400 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-02-10 23:43:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4992 transitions. [2022-02-10 23:43:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:21,402 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:21,402 INFO L515 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-02-10 23:43:21,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:21,619 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-02-10 23:43:21,619 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-02-10 23:43:21,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash 782515202, now seen corresponding path program 17 times [2022-02-10 23:43:21,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:21,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965055041] [2022-02-10 23:43:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:21,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:21,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965055041] [2022-02-10 23:43:21,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965055041] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:21,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090341264] [2022-02-10 23:43:21,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:21,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:21,766 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-02-10 23:43:21,767 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-02-10 23:43:21,934 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:21,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:21,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:21,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:22,171 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-02-10 23:43:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:22,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:22,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090341264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:22,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:22,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:22,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515058635] [2022-02-10 23:43:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:22,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:22,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:22,230 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-02-10 23:43:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:22,980 INFO L93 Difference]: Finished difference Result 7089 states and 13973 transitions. [2022-02-10 23:43:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-10 23:43:22,980 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-02-10 23:43:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:22,988 INFO L225 Difference]: With dead ends: 7089 [2022-02-10 23:43:22,988 INFO L226 Difference]: Without dead ends: 7089 [2022-02-10 23:43:22,988 INFO L933 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-02-10 23:43:22,989 INFO L934 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-02-10 23:43:22,989 INFO L935 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-02-10 23:43:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-02-10 23:43:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2554. [2022-02-10 23:43:23,021 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-02-10 23:43:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-02-10 23:43:23,024 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-02-10 23:43:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:23,024 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-02-10 23:43:23,024 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-02-10 23:43:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-02-10 23:43:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:23,025 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:23,025 INFO L515 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-02-10 23:43:23,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:23,226 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-02-10 23:43:23,226 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-02-10 23:43:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash -612674444, now seen corresponding path program 18 times [2022-02-10 23:43:23,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:23,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320022929] [2022-02-10 23:43:23,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:23,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:23,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:23,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320022929] [2022-02-10 23:43:23,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320022929] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:23,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917681989] [2022-02-10 23:43:23,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:23,495 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-02-10 23:43:23,495 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-02-10 23:43:23,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:23,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:23,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:23,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:23,831 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-02-10 23:43:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:23,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:23,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917681989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:23,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:23,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:23,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271318696] [2022-02-10 23:43:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:23,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:23,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:23,937 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-02-10 23:43:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:24,218 INFO L93 Difference]: Finished difference Result 4622 states and 9091 transitions. [2022-02-10 23:43:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:24,219 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-02-10 23:43:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:24,223 INFO L225 Difference]: With dead ends: 4622 [2022-02-10 23:43:24,223 INFO L226 Difference]: Without dead ends: 4622 [2022-02-10 23:43:24,224 INFO L933 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-02-10 23:43:24,224 INFO L934 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-02-10 23:43:24,224 INFO L935 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-02-10 23:43:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-02-10 23:43:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2611. [2022-02-10 23:43:24,250 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-02-10 23:43:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 5102 transitions. [2022-02-10 23:43:24,252 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 5102 transitions. Word has length 105 [2022-02-10 23:43:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:24,253 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 5102 transitions. [2022-02-10 23:43:24,253 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-02-10 23:43:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 5102 transitions. [2022-02-10 23:43:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:24,254 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:24,254 INFO L515 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-02-10 23:43:24,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-02-10 23:43:24,454 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-02-10 23:43:24,455 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-02-10 23:43:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash -830929600, now seen corresponding path program 19 times [2022-02-10 23:43:24,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:24,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74769233] [2022-02-10 23:43:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:24,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:24,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:24,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74769233] [2022-02-10 23:43:24,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74769233] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:24,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448828792] [2022-02-10 23:43:24,574 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:24,576 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-02-10 23:43:24,577 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-02-10 23:43:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:24,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:24,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:24,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-10 23:43:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:25,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:25,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448828792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:25,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:25,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:25,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029543144] [2022-02-10 23:43:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:25,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:25,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:25,017 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-02-10 23:43:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:25,330 INFO L93 Difference]: Finished difference Result 5142 states and 10145 transitions. [2022-02-10 23:43:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-02-10 23:43:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:25,336 INFO L225 Difference]: With dead ends: 5142 [2022-02-10 23:43:25,336 INFO L226 Difference]: Without dead ends: 5142 [2022-02-10 23:43:25,337 INFO L933 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-02-10 23:43:25,337 INFO L934 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-02-10 23:43:25,337 INFO L935 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-02-10 23:43:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-02-10 23:43:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 2626. [2022-02-10 23:43:25,371 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-02-10 23:43:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-02-10 23:43:25,374 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-02-10 23:43:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:25,374 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-02-10 23:43:25,374 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-02-10 23:43:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-02-10 23:43:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:25,376 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:25,376 INFO L515 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-02-10 23:43:25,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-02-10 23:43:25,576 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-02-10 23:43:25,577 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-02-10 23:43:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1817223392, now seen corresponding path program 20 times [2022-02-10 23:43:25,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:25,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610790712] [2022-02-10 23:43:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:25,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:25,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610790712] [2022-02-10 23:43:25,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610790712] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:25,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569495619] [2022-02-10 23:43:25,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:25,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:25,871 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-02-10 23:43:25,872 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-02-10 23:43:26,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:26,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:26,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:26,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:26,246 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-02-10 23:43:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:26,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:26,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569495619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:26,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:26,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:26,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357612491] [2022-02-10 23:43:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:26,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:26,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:26,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:26,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:26,307 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-02-10 23:43:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:27,031 INFO L93 Difference]: Finished difference Result 6445 states and 12713 transitions. [2022-02-10 23:43:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:43:27,031 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-02-10 23:43:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:27,039 INFO L225 Difference]: With dead ends: 6445 [2022-02-10 23:43:27,039 INFO L226 Difference]: Without dead ends: 6445 [2022-02-10 23:43:27,040 INFO L933 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-02-10 23:43:27,040 INFO L934 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-02-10 23:43:27,040 INFO L935 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-02-10 23:43:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-02-10 23:43:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 2623. [2022-02-10 23:43:27,082 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-02-10 23:43:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-02-10 23:43:27,085 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-02-10 23:43:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:27,085 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-02-10 23:43:27,085 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-02-10 23:43:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-02-10 23:43:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:27,087 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:27,087 INFO L515 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-02-10 23:43:27,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:27,287 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-02-10 23:43:27,287 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-02-10 23:43:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash -315350844, now seen corresponding path program 21 times [2022-02-10 23:43:27,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:27,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62115655] [2022-02-10 23:43:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:27,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:27,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:27,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62115655] [2022-02-10 23:43:27,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62115655] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:27,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379571995] [2022-02-10 23:43:27,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:27,567 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-02-10 23:43:27,568 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-02-10 23:43:27,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:27,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:27,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:27,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:27,996 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-02-10 23:43:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:28,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:28,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379571995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:28,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:28,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:28,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181604119] [2022-02-10 23:43:28,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:28,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:28,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:28,064 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-02-10 23:43:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:28,917 INFO L93 Difference]: Finished difference Result 8268 states and 16326 transitions. [2022-02-10 23:43:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:28,918 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-02-10 23:43:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:28,927 INFO L225 Difference]: With dead ends: 8268 [2022-02-10 23:43:28,928 INFO L226 Difference]: Without dead ends: 8268 [2022-02-10 23:43:28,928 INFO L933 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-02-10 23:43:28,929 INFO L934 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-02-10 23:43:28,929 INFO L935 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-02-10 23:43:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2022-02-10 23:43:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 2627. [2022-02-10 23:43:28,976 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-02-10 23:43:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-02-10 23:43:28,979 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-02-10 23:43:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:28,979 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-02-10 23:43:28,979 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-02-10 23:43:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-02-10 23:43:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:28,980 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:28,980 INFO L515 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-02-10 23:43:28,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-02-10 23:43:29,181 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-02-10 23:43:29,181 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-02-10 23:43:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -883343314, now seen corresponding path program 22 times [2022-02-10 23:43:29,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:29,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197570672] [2022-02-10 23:43:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:29,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:29,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197570672] [2022-02-10 23:43:29,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197570672] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:29,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276189351] [2022-02-10 23:43:29,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:29,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:29,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:29,469 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-02-10 23:43:29,487 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-02-10 23:43:29,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:29,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:29,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:43:29,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:29,828 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-02-10 23:43:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:29,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:29,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276189351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:29,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:29,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-02-10 23:43:29,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006982175] [2022-02-10 23:43:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:29,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:43:29,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:29,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:43:29,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-02-10 23:43:29,877 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-02-10 23:43:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:30,476 INFO L93 Difference]: Finished difference Result 7769 states and 15347 transitions. [2022-02-10 23:43:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 23:43:30,477 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-02-10 23:43:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:30,486 INFO L225 Difference]: With dead ends: 7769 [2022-02-10 23:43:30,486 INFO L226 Difference]: Without dead ends: 7769 [2022-02-10 23:43:30,486 INFO L933 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-02-10 23:43:30,487 INFO L934 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-02-10 23:43:30,487 INFO L935 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-02-10 23:43:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7769 states. [2022-02-10 23:43:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7769 to 2629. [2022-02-10 23:43:30,528 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-02-10 23:43:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-02-10 23:43:30,531 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-02-10 23:43:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:30,531 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-02-10 23:43:30,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-02-10 23:43:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-02-10 23:43:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:30,532 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:30,532 INFO L515 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-02-10 23:43:30,551 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-02-10 23:43:30,749 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-02-10 23:43:30,750 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-02-10 23:43:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 567459132, now seen corresponding path program 23 times [2022-02-10 23:43:30,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:30,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001464523] [2022-02-10 23:43:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:31,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:31,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001464523] [2022-02-10 23:43:31,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001464523] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:31,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658291317] [2022-02-10 23:43:31,053 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:31,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:31,054 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-02-10 23:43:31,055 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-02-10 23:43:31,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:31,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:31,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:31,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:31,464 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-02-10 23:43:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:31,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:31,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658291317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:31,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:31,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:31,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738442332] [2022-02-10 23:43:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:31,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:31,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:31,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:31,527 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-02-10 23:43:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:32,309 INFO L93 Difference]: Finished difference Result 6754 states and 13293 transitions. [2022-02-10 23:43:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:43:32,310 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-02-10 23:43:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:32,317 INFO L225 Difference]: With dead ends: 6754 [2022-02-10 23:43:32,318 INFO L226 Difference]: Without dead ends: 6754 [2022-02-10 23:43:32,318 INFO L933 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-02-10 23:43:32,319 INFO L934 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-02-10 23:43:32,319 INFO L935 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-02-10 23:43:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2022-02-10 23:43:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 2617. [2022-02-10 23:43:32,350 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-02-10 23:43:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-02-10 23:43:32,352 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-02-10 23:43:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:32,353 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-02-10 23:43:32,353 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-02-10 23:43:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-02-10 23:43:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:32,354 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:32,354 INFO L515 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-02-10 23:43:32,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:32,555 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-02-10 23:43:32,555 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-02-10 23:43:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1968483042, now seen corresponding path program 24 times [2022-02-10 23:43:32,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:32,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882182669] [2022-02-10 23:43:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:32,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:32,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882182669] [2022-02-10 23:43:32,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882182669] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:32,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515768553] [2022-02-10 23:43:32,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:32,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:32,716 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-02-10 23:43:32,771 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-02-10 23:43:32,914 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:32,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:32,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:33,152 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-02-10 23:43:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:33,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:33,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515768553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:33,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:33,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:33,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224781152] [2022-02-10 23:43:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:33,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:33,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:33,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:33,213 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-02-10 23:43:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:34,043 INFO L93 Difference]: Finished difference Result 7944 states and 15678 transitions. [2022-02-10 23:43:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 23:43:34,044 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-02-10 23:43:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:34,053 INFO L225 Difference]: With dead ends: 7944 [2022-02-10 23:43:34,053 INFO L226 Difference]: Without dead ends: 7944 [2022-02-10 23:43:34,054 INFO L933 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-02-10 23:43:34,054 INFO L934 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-02-10 23:43:34,054 INFO L935 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-02-10 23:43:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-02-10 23:43:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 2627. [2022-02-10 23:43:34,092 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-02-10 23:43:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-02-10 23:43:34,095 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-02-10 23:43:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:34,095 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-02-10 23:43:34,095 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-02-10 23:43:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-02-10 23:43:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:34,096 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:34,096 INFO L515 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-02-10 23:43:34,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-02-10 23:43:34,297 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-02-10 23:43:34,297 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-02-10 23:43:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1400490572, now seen corresponding path program 25 times [2022-02-10 23:43:34,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:34,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643933287] [2022-02-10 23:43:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:34,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:34,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643933287] [2022-02-10 23:43:34,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643933287] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:34,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175245885] [2022-02-10 23:43:34,442 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:34,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:34,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:34,443 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-02-10 23:43:34,443 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-02-10 23:43:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:34,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:34,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:34,800 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-02-10 23:43:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:34,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:34,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175245885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:34,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:34,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:34,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812691521] [2022-02-10 23:43:34,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:34,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:34,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:34,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:34,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:34,874 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-02-10 23:43:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:35,370 INFO L93 Difference]: Finished difference Result 8265 states and 16287 transitions. [2022-02-10 23:43:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-10 23:43:35,370 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-02-10 23:43:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:35,379 INFO L225 Difference]: With dead ends: 8265 [2022-02-10 23:43:35,379 INFO L226 Difference]: Without dead ends: 8265 [2022-02-10 23:43:35,380 INFO L933 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-02-10 23:43:35,380 INFO L934 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-02-10 23:43:35,380 INFO L935 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-02-10 23:43:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2022-02-10 23:43:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 2629. [2022-02-10 23:43:35,422 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-02-10 23:43:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-02-10 23:43:35,424 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-02-10 23:43:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:35,425 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-02-10 23:43:35,425 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-02-10 23:43:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-02-10 23:43:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:35,426 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:35,426 INFO L515 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-02-10 23:43:35,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:35,626 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-02-10 23:43:35,627 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-02-10 23:43:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1443674278, now seen corresponding path program 26 times [2022-02-10 23:43:35,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:35,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544998525] [2022-02-10 23:43:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:35,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:35,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544998525] [2022-02-10 23:43:35,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544998525] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:35,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864439902] [2022-02-10 23:43:35,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:35,775 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-02-10 23:43:35,776 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-02-10 23:43:35,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:35,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:35,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:35,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:36,139 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-02-10 23:43:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:36,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:36,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864439902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:36,199 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:36,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:36,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55658035] [2022-02-10 23:43:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:36,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:36,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:36,200 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-02-10 23:43:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:37,029 INFO L93 Difference]: Finished difference Result 8307 states and 16347 transitions. [2022-02-10 23:43:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:37,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-02-10 23:43:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:37,041 INFO L225 Difference]: With dead ends: 8307 [2022-02-10 23:43:37,041 INFO L226 Difference]: Without dead ends: 8307 [2022-02-10 23:43:37,042 INFO L933 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-02-10 23:43:37,042 INFO L934 BasicCegarLoop]: 328 mSDtfsCounter, 954 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:37,042 INFO L935 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-02-10 23:43:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2022-02-10 23:43:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 2623. [2022-02-10 23:43:37,094 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-02-10 23:43:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-02-10 23:43:37,096 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-02-10 23:43:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:37,097 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-02-10 23:43:37,097 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-02-10 23:43:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-02-10 23:43:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:37,098 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:37,098 INFO L515 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-02-10 23:43:37,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:37,298 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-02-10 23:43:37,298 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-02-10 23:43:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1237259930, now seen corresponding path program 27 times [2022-02-10 23:43:37,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:37,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946386426] [2022-02-10 23:43:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:37,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-02-10 23:43:37,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:37,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946386426] [2022-02-10 23:43:37,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946386426] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:37,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598271212] [2022-02-10 23:43:37,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:37,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:37,407 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-02-10 23:43:37,408 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-02-10 23:43:37,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:37,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:37,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:37,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:37,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-02-10 23:43:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:37,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:37,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598271212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:37,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:37,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:37,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624600651] [2022-02-10 23:43:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:37,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:37,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:37,887 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-02-10 23:43:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:38,370 INFO L93 Difference]: Finished difference Result 7504 states and 14817 transitions. [2022-02-10 23:43:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:38,370 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-02-10 23:43:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:38,379 INFO L225 Difference]: With dead ends: 7504 [2022-02-10 23:43:38,379 INFO L226 Difference]: Without dead ends: 7504 [2022-02-10 23:43:38,379 INFO L933 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-02-10 23:43:38,379 INFO L934 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-02-10 23:43:38,380 INFO L935 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-02-10 23:43:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2022-02-10 23:43:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 2628. [2022-02-10 23:43:38,417 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-02-10 23:43:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 5136 transitions. [2022-02-10 23:43:38,420 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 5136 transitions. Word has length 105 [2022-02-10 23:43:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:38,420 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 5136 transitions. [2022-02-10 23:43:38,420 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-02-10 23:43:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 5136 transitions. [2022-02-10 23:43:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:38,421 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:38,422 INFO L515 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-02-10 23:43:38,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-02-10 23:43:38,634 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-02-10 23:43:38,635 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-02-10 23:43:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2047530010, now seen corresponding path program 28 times [2022-02-10 23:43:38,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:38,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289615416] [2022-02-10 23:43:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:38,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:38,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289615416] [2022-02-10 23:43:38,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289615416] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:38,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762974968] [2022-02-10 23:43:38,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:38,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:38,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:38,780 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-02-10 23:43:38,781 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-02-10 23:43:38,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:38,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:38,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-10 23:43:38,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:39,246 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-02-10 23:43:39,373 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-02-10 23:43:39,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,400 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-02-10 23:43:39,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,441 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-02-10 23:43:39,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,495 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-02-10 23:43:39,540 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 23:43:39,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-02-10 23:43:39,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:39,641 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:43:39,641 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-02-10 23:43:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:39,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:39,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762974968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:39,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:39,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-02-10 23:43:39,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189773325] [2022-02-10 23:43:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:39,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-10 23:43:39,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:39,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-10 23:43:39,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-02-10 23:43:39,668 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-02-10 23:43:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:41,478 INFO L93 Difference]: Finished difference Result 7649 states and 15107 transitions. [2022-02-10 23:43:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-10 23:43:41,478 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-02-10 23:43:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:41,489 INFO L225 Difference]: With dead ends: 7649 [2022-02-10 23:43:41,490 INFO L226 Difference]: Without dead ends: 7649 [2022-02-10 23:43:41,490 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=556, Invalid=2200, Unknown=0, NotChecked=0, Total=2756 [2022-02-10 23:43:41,491 INFO L934 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-02-10 23:43:41,491 INFO L935 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-02-10 23:43:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2022-02-10 23:43:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 2648. [2022-02-10 23:43:41,544 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-02-10 23:43:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 5176 transitions. [2022-02-10 23:43:41,547 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 5176 transitions. Word has length 105 [2022-02-10 23:43:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:41,547 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 5176 transitions. [2022-02-10 23:43:41,547 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-02-10 23:43:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 5176 transitions. [2022-02-10 23:43:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:41,548 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:41,548 INFO L515 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-02-10 23:43:41,565 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-02-10 23:43:41,749 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-02-10 23:43:41,749 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-02-10 23:43:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1665619056, now seen corresponding path program 29 times [2022-02-10 23:43:41,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:41,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196887084] [2022-02-10 23:43:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:42,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:42,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196887084] [2022-02-10 23:43:42,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196887084] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:42,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507411375] [2022-02-10 23:43:42,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:42,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:42,012 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-02-10 23:43:42,013 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-02-10 23:43:42,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:42,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:42,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:42,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:42,474 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-02-10 23:43:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:42,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:42,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507411375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:42,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:42,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:42,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543681695] [2022-02-10 23:43:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:42,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:42,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:42,534 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-02-10 23:43:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:43,373 INFO L93 Difference]: Finished difference Result 7727 states and 15225 transitions. [2022-02-10 23:43:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:43:43,374 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-02-10 23:43:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:43,383 INFO L225 Difference]: With dead ends: 7727 [2022-02-10 23:43:43,383 INFO L226 Difference]: Without dead ends: 7727 [2022-02-10 23:43:43,383 INFO L933 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-02-10 23:43:43,384 INFO L934 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-02-10 23:43:43,384 INFO L935 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-02-10 23:43:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2022-02-10 23:43:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 2626. [2022-02-10 23:43:43,423 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-02-10 23:43:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-02-10 23:43:43,426 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-02-10 23:43:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:43,426 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-02-10 23:43:43,426 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-02-10 23:43:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-02-10 23:43:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:43,428 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:43,428 INFO L515 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-02-10 23:43:43,444 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-02-10 23:43:43,628 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-02-10 23:43:43,628 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-02-10 23:43:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash 652340364, now seen corresponding path program 30 times [2022-02-10 23:43:43,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:43,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404080031] [2022-02-10 23:43:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:43,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:43,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:43,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404080031] [2022-02-10 23:43:43,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404080031] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:43,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352223061] [2022-02-10 23:43:43,907 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:43,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:43,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:43,908 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-02-10 23:43:43,908 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-02-10 23:43:44,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:44,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:44,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:44,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:44,271 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-02-10 23:43:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:44,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:44,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352223061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:44,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:44,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:44,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898344664] [2022-02-10 23:43:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:44,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:44,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:44,378 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-02-10 23:43:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:44,699 INFO L93 Difference]: Finished difference Result 5260 states and 10343 transitions. [2022-02-10 23:43:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:44,700 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-02-10 23:43:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:44,705 INFO L225 Difference]: With dead ends: 5260 [2022-02-10 23:43:44,705 INFO L226 Difference]: Without dead ends: 5260 [2022-02-10 23:43:44,705 INFO L933 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-02-10 23:43:44,705 INFO L934 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-02-10 23:43:44,705 INFO L935 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-02-10 23:43:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2022-02-10 23:43:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 2608. [2022-02-10 23:43:44,733 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-02-10 23:43:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-02-10 23:43:44,736 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-02-10 23:43:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:44,736 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-02-10 23:43:44,736 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-02-10 23:43:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-02-10 23:43:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:44,737 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:44,737 INFO L515 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-02-10 23:43:44,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:44,951 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-02-10 23:43:44,951 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-02-10 23:43:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash 564648876, now seen corresponding path program 31 times [2022-02-10 23:43:44,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:44,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714715300] [2022-02-10 23:43:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:45,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:45,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714715300] [2022-02-10 23:43:45,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714715300] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:45,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123019920] [2022-02-10 23:43:45,217 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:45,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:45,218 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-02-10 23:43:45,247 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-02-10 23:43:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:45,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:45,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:45,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-10 23:43:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:45,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:45,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123019920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:45,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:45,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:45,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102616846] [2022-02-10 23:43:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:45,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:45,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:45,718 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-02-10 23:43:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:46,638 INFO L93 Difference]: Finished difference Result 6726 states and 13266 transitions. [2022-02-10 23:43:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:46,638 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-02-10 23:43:46,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:46,647 INFO L225 Difference]: With dead ends: 6726 [2022-02-10 23:43:46,647 INFO L226 Difference]: Without dead ends: 6726 [2022-02-10 23:43:46,647 INFO L933 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-02-10 23:43:46,648 INFO L934 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.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:46,648 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1594 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2022-02-10 23:43:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 2616. [2022-02-10 23:43:46,687 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-02-10 23:43:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 5112 transitions. [2022-02-10 23:43:46,690 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 5112 transitions. Word has length 105 [2022-02-10 23:43:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:46,690 INFO L470 AbstractCegarLoop]: Abstraction has 2616 states and 5112 transitions. [2022-02-10 23:43:46,690 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-02-10 23:43:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 5112 transitions. [2022-02-10 23:43:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:46,691 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:46,692 INFO L515 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-02-10 23:43:46,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:46,907 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-02-10 23:43:46,907 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-02-10 23:43:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -3343594, now seen corresponding path program 32 times [2022-02-10 23:43:46,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:46,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589944561] [2022-02-10 23:43:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:47,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:47,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589944561] [2022-02-10 23:43:47,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589944561] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:47,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030660125] [2022-02-10 23:43:47,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:47,060 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-02-10 23:43:47,061 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-02-10 23:43:47,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:47,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:47,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:47,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:47,449 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-02-10 23:43:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:47,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:47,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030660125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:47,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:47,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:47,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670665744] [2022-02-10 23:43:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:47,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:47,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:47,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:47,527 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-02-10 23:43:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:48,050 INFO L93 Difference]: Finished difference Result 7047 states and 13875 transitions. [2022-02-10 23:43:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:48,050 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-02-10 23:43:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:48,061 INFO L225 Difference]: With dead ends: 7047 [2022-02-10 23:43:48,061 INFO L226 Difference]: Without dead ends: 7047 [2022-02-10 23:43:48,061 INFO L933 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-02-10 23:43:48,061 INFO L934 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-02-10 23:43:48,062 INFO L935 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-02-10 23:43:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2022-02-10 23:43:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 2618. [2022-02-10 23:43:48,114 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-02-10 23:43:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 5116 transitions. [2022-02-10 23:43:48,117 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 5116 transitions. Word has length 105 [2022-02-10 23:43:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:48,117 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 5116 transitions. [2022-02-10 23:43:48,117 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-02-10 23:43:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 5116 transitions. [2022-02-10 23:43:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:48,118 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:48,118 INFO L515 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-02-10 23:43:48,135 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-02-10 23:43:48,318 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-02-10 23:43:48,319 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-02-10 23:43:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1447458852, now seen corresponding path program 33 times [2022-02-10 23:43:48,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:48,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898218991] [2022-02-10 23:43:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:48,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:48,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898218991] [2022-02-10 23:43:48,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898218991] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:48,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375870335] [2022-02-10 23:43:48,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:48,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:48,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:48,576 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-02-10 23:43:48,577 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-02-10 23:43:48,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:48,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:48,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:48,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:49,018 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-02-10 23:43:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:49,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:49,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375870335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:49,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:49,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:49,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468617744] [2022-02-10 23:43:49,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:49,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:49,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:49,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:49,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:49,081 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-02-10 23:43:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:49,982 INFO L93 Difference]: Finished difference Result 7089 states and 13935 transitions. [2022-02-10 23:43:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:49,983 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-02-10 23:43:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:49,990 INFO L225 Difference]: With dead ends: 7089 [2022-02-10 23:43:49,990 INFO L226 Difference]: Without dead ends: 7089 [2022-02-10 23:43:49,991 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2022-02-10 23:43:49,991 INFO L934 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-02-10 23:43:49,991 INFO L935 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-02-10 23:43:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-02-10 23:43:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2612. [2022-02-10 23:43:50,025 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-02-10 23:43:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 5104 transitions. [2022-02-10 23:43:50,028 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 5104 transitions. Word has length 105 [2022-02-10 23:43:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:50,028 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 5104 transitions. [2022-02-10 23:43:50,028 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-02-10 23:43:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 5104 transitions. [2022-02-10 23:43:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:50,029 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:50,029 INFO L515 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-02-10 23:43:50,048 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-02-10 23:43:50,234 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-02-10 23:43:50,234 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-02-10 23:43:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -166574236, now seen corresponding path program 34 times [2022-02-10 23:43:50,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:50,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954916267] [2022-02-10 23:43:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:50,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:50,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954916267] [2022-02-10 23:43:50,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954916267] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:50,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792392879] [2022-02-10 23:43:50,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:50,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:50,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:50,507 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-02-10 23:43:50,509 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-02-10 23:43:50,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:50,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:50,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-10 23:43:50,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:50,976 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-02-10 23:43:51,109 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-02-10 23:43:51,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,152 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-02-10 23:43:51,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,204 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-02-10 23:43:51,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,250 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-02-10 23:43:51,305 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 23:43:51,305 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-02-10 23:43:51,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:43:51,395 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:43:51,395 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-02-10 23:43:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:51,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:51,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792392879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:51,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:51,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2022-02-10 23:43:51,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548401634] [2022-02-10 23:43:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:51,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-10 23:43:51,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:51,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-10 23:43:51,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-02-10 23:43:51,439 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-02-10 23:43:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:52,995 INFO L93 Difference]: Finished difference Result 8798 states and 17396 transitions. [2022-02-10 23:43:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:52,995 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-02-10 23:43:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:53,005 INFO L225 Difference]: With dead ends: 8798 [2022-02-10 23:43:53,005 INFO L226 Difference]: Without dead ends: 8798 [2022-02-10 23:43:53,005 INFO L933 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-02-10 23:43:53,006 INFO L934 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-02-10 23:43:53,006 INFO L935 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-02-10 23:43:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2022-02-10 23:43:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 2658. [2022-02-10 23:43:53,049 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-02-10 23:43:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 5196 transitions. [2022-02-10 23:43:53,052 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 5196 transitions. Word has length 105 [2022-02-10 23:43:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:53,052 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 5196 transitions. [2022-02-10 23:43:53,052 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-02-10 23:43:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 5196 transitions. [2022-02-10 23:43:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:53,053 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:53,053 INFO L515 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-02-10 23:43:53,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-02-10 23:43:53,254 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-02-10 23:43:53,254 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-02-10 23:43:53,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 415243994, now seen corresponding path program 35 times [2022-02-10 23:43:53,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:53,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337282075] [2022-02-10 23:43:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:53,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:53,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337282075] [2022-02-10 23:43:53,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337282075] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:53,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439964317] [2022-02-10 23:43:53,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:53,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:53,518 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-02-10 23:43:53,519 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-02-10 23:43:53,740 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:53,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:53,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:53,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:53,959 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-02-10 23:43:54,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-02-10 23:43:54,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:54,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439964317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:54,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:54,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:54,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160620214] [2022-02-10 23:43:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:54,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:54,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:54,041 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-02-10 23:43:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:54,569 INFO L93 Difference]: Finished difference Result 7844 states and 15465 transitions. [2022-02-10 23:43:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:54,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-02-10 23:43:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:54,578 INFO L225 Difference]: With dead ends: 7844 [2022-02-10 23:43:54,578 INFO L226 Difference]: Without dead ends: 7844 [2022-02-10 23:43:54,579 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 23:43:54,579 INFO L934 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-02-10 23:43:54,579 INFO L935 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-02-10 23:43:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-02-10 23:43:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 2617. [2022-02-10 23:43:54,627 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-02-10 23:43:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-02-10 23:43:54,629 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-02-10 23:43:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:54,629 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-02-10 23:43:54,630 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-02-10 23:43:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-02-10 23:43:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:54,631 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:54,631 INFO L515 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-02-10 23:43:54,648 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-02-10 23:43:54,831 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-02-10 23:43:54,831 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-02-10 23:43:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 643695844, now seen corresponding path program 36 times [2022-02-10 23:43:54,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:54,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012100450] [2022-02-10 23:43:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:54,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:54,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012100450] [2022-02-10 23:43:54,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012100450] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:54,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243318796] [2022-02-10 23:43:54,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:54,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:54,930 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-02-10 23:43:54,957 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-02-10 23:43:55,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:55,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:55,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:55,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:55,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-02-10 23:43:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:55,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:55,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243318796] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:55,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:55,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:55,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205595684] [2022-02-10 23:43:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:55,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:55,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:55,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:55,428 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-02-10 23:43:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:56,243 INFO L93 Difference]: Finished difference Result 8063 states and 15869 transitions. [2022-02-10 23:43:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:56,244 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-02-10 23:43:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:56,255 INFO L225 Difference]: With dead ends: 8063 [2022-02-10 23:43:56,255 INFO L226 Difference]: Without dead ends: 8063 [2022-02-10 23:43:56,255 INFO L933 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-02-10 23:43:56,256 INFO L934 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-02-10 23:43:56,256 INFO L935 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-02-10 23:43:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2022-02-10 23:43:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 2615. [2022-02-10 23:43:56,299 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-02-10 23:43:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5110 transitions. [2022-02-10 23:43:56,302 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5110 transitions. Word has length 105 [2022-02-10 23:43:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:56,302 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 5110 transitions. [2022-02-10 23:43:56,302 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-02-10 23:43:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5110 transitions. [2022-02-10 23:43:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:56,303 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:56,304 INFO L515 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-02-10 23:43:56,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-02-10 23:43:56,504 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-02-10 23:43:56,504 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-02-10 23:43:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash -751493802, now seen corresponding path program 37 times [2022-02-10 23:43:56,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:56,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823436675] [2022-02-10 23:43:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:56,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:56,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823436675] [2022-02-10 23:43:56,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823436675] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:56,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050510144] [2022-02-10 23:43:56,622 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:56,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:56,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:56,623 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-02-10 23:43:56,624 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-02-10 23:43:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:56,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:56,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:57,035 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-02-10 23:43:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:57,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:57,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050510144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:57,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:57,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:57,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073018621] [2022-02-10 23:43:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:57,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:57,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:57,146 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-02-10 23:43:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:57,463 INFO L93 Difference]: Finished difference Result 5596 states and 10987 transitions. [2022-02-10 23:43:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:43:57,463 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-02-10 23:43:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:57,469 INFO L225 Difference]: With dead ends: 5596 [2022-02-10 23:43:57,469 INFO L226 Difference]: Without dead ends: 5596 [2022-02-10 23:43:57,470 INFO L933 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-02-10 23:43:57,470 INFO L934 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-02-10 23:43:57,470 INFO L935 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-02-10 23:43:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-02-10 23:43:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 2606. [2022-02-10 23:43:57,503 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-02-10 23:43:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 5092 transitions. [2022-02-10 23:43:57,505 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 5092 transitions. Word has length 105 [2022-02-10 23:43:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:57,506 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 5092 transitions. [2022-02-10 23:43:57,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 5092 transitions. [2022-02-10 23:43:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:57,507 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:57,507 INFO L515 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-02-10 23:43:57,526 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-02-10 23:43:57,709 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-02-10 23:43:57,710 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-02-10 23:43:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1780597932, now seen corresponding path program 38 times [2022-02-10 23:43:57,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:57,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137456285] [2022-02-10 23:43:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:57,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:57,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137456285] [2022-02-10 23:43:57,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137456285] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:57,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418337783] [2022-02-10 23:43:57,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:57,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:57,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:57,870 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-02-10 23:43:57,871 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-02-10 23:43:58,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:58,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:58,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:58,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:58,302 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-02-10 23:43:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:58,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:58,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418337783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:58,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:58,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:58,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51734462] [2022-02-10 23:43:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:58,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:58,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:58,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:58,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:58,379 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-02-10 23:43:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:58,887 INFO L93 Difference]: Finished difference Result 6301 states and 12435 transitions. [2022-02-10 23:43:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:58,887 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-02-10 23:43:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:58,894 INFO L225 Difference]: With dead ends: 6301 [2022-02-10 23:43:58,894 INFO L226 Difference]: Without dead ends: 6301 [2022-02-10 23:43:58,894 INFO L933 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-02-10 23:43:58,894 INFO L934 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-02-10 23:43:58,895 INFO L935 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-02-10 23:43:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2022-02-10 23:43:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 2610. [2022-02-10 23:43:58,945 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-02-10 23:43:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 5100 transitions. [2022-02-10 23:43:58,947 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 5100 transitions. Word has length 105 [2022-02-10 23:43:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:58,948 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 5100 transitions. [2022-02-10 23:43:58,948 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-02-10 23:43:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 5100 transitions. [2022-02-10 23:43:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:58,949 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:58,949 INFO L515 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-02-10 23:43:58,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-02-10 23:43:59,150 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-02-10 23:43:59,150 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-02-10 23:43:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1704099284, now seen corresponding path program 39 times [2022-02-10 23:43:59,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:59,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394965791] [2022-02-10 23:43:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:59,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:59,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394965791] [2022-02-10 23:43:59,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394965791] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:59,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97447892] [2022-02-10 23:43:59,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:59,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:59,239 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-02-10 23:43:59,240 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-02-10 23:43:59,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:59,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:59,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:59,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:59,661 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-02-10 23:43:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:59,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:59,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97447892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:59,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:59,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:59,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179550872] [2022-02-10 23:43:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:59,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:59,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:59,720 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-02-10 23:44:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:00,551 INFO L93 Difference]: Finished difference Result 6524 states and 12843 transitions. [2022-02-10 23:44:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:44:00,551 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-02-10 23:44:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:00,559 INFO L225 Difference]: With dead ends: 6524 [2022-02-10 23:44:00,559 INFO L226 Difference]: Without dead ends: 6524 [2022-02-10 23:44:00,559 INFO L933 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-02-10 23:44:00,560 INFO L934 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-02-10 23:44:00,560 INFO L935 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-02-10 23:44:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2022-02-10 23:44:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 2608. [2022-02-10 23:44:00,594 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-02-10 23:44:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-02-10 23:44:00,596 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-02-10 23:44:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:00,596 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-02-10 23:44:00,597 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-02-10 23:44:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-02-10 23:44:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:00,598 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:00,598 INFO L515 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-02-10 23:44:00,618 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-02-10 23:44:00,798 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-02-10 23:44:00,798 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-02-10 23:44:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1195678366, now seen corresponding path program 40 times [2022-02-10 23:44:00,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:00,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325458144] [2022-02-10 23:44:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:00,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:00,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325458144] [2022-02-10 23:44:00,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325458144] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:00,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139672657] [2022-02-10 23:44:00,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:44:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:00,953 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-02-10 23:44:00,954 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-02-10 23:44:01,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:44:01,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-10 23:44:01,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:01,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-02-10 23:44:01,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-02-10 23:44:01,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,485 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-02-10 23:44:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,516 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-02-10 23:44:01,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:01,552 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-02-10 23:44:01,587 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-02-10 23:44:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:01,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:01,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139672657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:01,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:01,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 15 [2022-02-10 23:44:01,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327411821] [2022-02-10 23:44:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:01,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-10 23:44:01,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-10 23:44:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-02-10 23:44:01,597 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-02-10 23:44:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:02,218 INFO L93 Difference]: Finished difference Result 5379 states and 10546 transitions. [2022-02-10 23:44:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:44:02,218 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-02-10 23:44:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:02,224 INFO L225 Difference]: With dead ends: 5379 [2022-02-10 23:44:02,224 INFO L226 Difference]: Without dead ends: 5379 [2022-02-10 23:44:02,224 INFO L933 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-02-10 23:44:02,225 INFO L934 BasicCegarLoop]: 239 mSDtfsCounter, 628 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:02,225 INFO L935 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-02-10 23:44:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-02-10 23:44:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2605. [2022-02-10 23:44:02,254 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-02-10 23:44:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 5090 transitions. [2022-02-10 23:44:02,257 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 5090 transitions. Word has length 105 [2022-02-10 23:44:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:02,257 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 5090 transitions. [2022-02-10 23:44:02,257 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-02-10 23:44:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 5090 transitions. [2022-02-10 23:44:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:02,258 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:02,258 INFO L515 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-02-10 23:44:02,275 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-02-10 23:44:02,458 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-02-10 23:44:02,459 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-02-10 23:44:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 49907308, now seen corresponding path program 41 times [2022-02-10 23:44:02,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:02,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544763963] [2022-02-10 23:44:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:02,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:02,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544763963] [2022-02-10 23:44:02,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544763963] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:02,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960267518] [2022-02-10 23:44:02,624 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:44:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:02,625 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-02-10 23:44:02,640 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-02-10 23:44:02,867 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:44:02,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:02,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:02,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:03,016 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-02-10 23:44:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:03,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:03,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960267518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:03,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:03,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:44:03,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436872936] [2022-02-10 23:44:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:03,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:03,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:44:03,131 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-02-10 23:44:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:03,460 INFO L93 Difference]: Finished difference Result 4902 states and 9651 transitions. [2022-02-10 23:44:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:44:03,460 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-02-10 23:44:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:03,465 INFO L225 Difference]: With dead ends: 4902 [2022-02-10 23:44:03,465 INFO L226 Difference]: Without dead ends: 4902 [2022-02-10 23:44:03,466 INFO L933 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-02-10 23:44:03,466 INFO L934 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-02-10 23:44:03,466 INFO L935 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-02-10 23:44:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-02-10 23:44:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 2634. [2022-02-10 23:44:03,494 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-02-10 23:44:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 5148 transitions. [2022-02-10 23:44:03,496 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 5148 transitions. Word has length 105 [2022-02-10 23:44:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:03,496 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 5148 transitions. [2022-02-10 23:44:03,497 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-02-10 23:44:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 5148 transitions. [2022-02-10 23:44:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-10 23:44:03,498 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:03,498 INFO L515 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-02-10 23:44:03,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-02-10 23:44:03,698 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-02-10 23:44:03,698 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-02-10 23:44:03,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash 225817577, now seen corresponding path program 1 times [2022-02-10 23:44:03,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:03,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606565751] [2022-02-10 23:44:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:03,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-02-10 23:44:03,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:03,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606565751] [2022-02-10 23:44:03,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606565751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:03,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:44:03,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:44:03,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942194945] [2022-02-10 23:44:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:03,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:44:03,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:03,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:44:03,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:44:03,750 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-02-10 23:44:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:03,838 INFO L93 Difference]: Finished difference Result 2900 states and 5680 transitions. [2022-02-10 23:44:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:44:03,838 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-02-10 23:44:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:03,843 INFO L225 Difference]: With dead ends: 2900 [2022-02-10 23:44:03,843 INFO L226 Difference]: Without dead ends: 2753 [2022-02-10 23:44:03,843 INFO L933 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-02-10 23:44:03,844 INFO L934 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-02-10 23:44:03,844 INFO L935 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-02-10 23:44:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2022-02-10 23:44:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2211. [2022-02-10 23:44:03,862 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-02-10 23:44:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4296 transitions. [2022-02-10 23:44:03,864 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4296 transitions. Word has length 114 [2022-02-10 23:44:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:03,864 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 4296 transitions. [2022-02-10 23:44:03,864 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-02-10 23:44:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4296 transitions. [2022-02-10 23:44:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:03,866 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:03,866 INFO L515 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-02-10 23:44:03,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-10 23:44:03,866 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-02-10 23:44:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1779983633, now seen corresponding path program 1 times [2022-02-10 23:44:03,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:03,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607042380] [2022-02-10 23:44:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:04,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:04,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607042380] [2022-02-10 23:44:04,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607042380] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:04,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337716215] [2022-02-10 23:44:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:04,106 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-02-10 23:44:04,107 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-02-10 23:44:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:04,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-10 23:44:04,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:05,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-10 23:44:05,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,079 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-02-10 23:44:05,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,119 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-02-10 23:44:05,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,169 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-02-10 23:44:05,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:05,298 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-02-10 23:44:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:05,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:05,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:05,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:06,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337716215] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:06,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:06,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:44:06,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028983918] [2022-02-10 23:44:06,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:06,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:44:06,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:06,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:44:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:44:06,372 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-02-10 23:44:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:09,267 INFO L93 Difference]: Finished difference Result 7926 states and 15628 transitions. [2022-02-10 23:44:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-10 23:44:09,268 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-02-10 23:44:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:09,278 INFO L225 Difference]: With dead ends: 7926 [2022-02-10 23:44:09,278 INFO L226 Difference]: Without dead ends: 7914 [2022-02-10 23:44:09,279 INFO L933 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-02-10 23:44:09,279 INFO L934 BasicCegarLoop]: 333 mSDtfsCounter, 2423 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:09,279 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 3947 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2912 Invalid, 0 Unknown, 220 Unchecked, 1.3s Time] [2022-02-10 23:44:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-02-10 23:44:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 3015. [2022-02-10 23:44:09,314 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-02-10 23:44:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5945 transitions. [2022-02-10 23:44:09,316 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5945 transitions. Word has length 134 [2022-02-10 23:44:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:09,317 INFO L470 AbstractCegarLoop]: Abstraction has 3015 states and 5945 transitions. [2022-02-10 23:44:09,317 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-02-10 23:44:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5945 transitions. [2022-02-10 23:44:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:09,319 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:09,319 INFO L515 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-02-10 23:44:09,336 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-02-10 23:44:09,519 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-02-10 23:44:09,520 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-02-10 23:44:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2062391747, now seen corresponding path program 2 times [2022-02-10 23:44:09,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:09,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291002813] [2022-02-10 23:44:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:09,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:09,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291002813] [2022-02-10 23:44:09,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291002813] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:09,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669502158] [2022-02-10 23:44:09,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:44:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:09,768 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-02-10 23:44:09,768 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-02-10 23:44:10,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:44:10,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:10,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-10 23:44:10,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:10,646 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-02-10 23:44:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,693 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-02-10 23:44:10,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,744 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-02-10 23:44:10,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:10,794 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-02-10 23:44:10,902 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-02-10 23:44:10,903 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-02-10 23:44:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:10,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:11,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:11,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:12,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669502158] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:12,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:12,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:44:12,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353077502] [2022-02-10 23:44:12,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:12,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:44:12,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:12,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:44:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:44:12,007 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-02-10 23:44:15,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:15,381 INFO L93 Difference]: Finished difference Result 7629 states and 15050 transitions. [2022-02-10 23:44:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-10 23:44:15,382 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-02-10 23:44:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:15,405 INFO L225 Difference]: With dead ends: 7629 [2022-02-10 23:44:15,405 INFO L226 Difference]: Without dead ends: 7620 [2022-02-10 23:44:15,406 INFO L933 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-02-10 23:44:15,406 INFO L934 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.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:15,406 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1997 Valid, 4794 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3952 Invalid, 0 Unknown, 279 Unchecked, 1.7s Time] [2022-02-10 23:44:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2022-02-10 23:44:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 3152. [2022-02-10 23:44:15,451 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-02-10 23:44:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 6219 transitions. [2022-02-10 23:44:15,455 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 6219 transitions. Word has length 134 [2022-02-10 23:44:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:15,455 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 6219 transitions. [2022-02-10 23:44:15,455 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-02-10 23:44:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 6219 transitions. [2022-02-10 23:44:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:15,458 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:15,458 INFO L515 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-02-10 23:44:15,476 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-02-10 23:44:15,675 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-02-10 23:44:15,675 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-02-10 23:44:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1179672212, now seen corresponding path program 1 times [2022-02-10 23:44:15,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:15,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428671582] [2022-02-10 23:44:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:15,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:15,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428671582] [2022-02-10 23:44:15,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428671582] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:15,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877354948] [2022-02-10 23:44:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:15,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:15,929 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-02-10 23:44:15,930 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-02-10 23:44:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:16,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-10 23:44:16,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:16,800 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-02-10 23:44:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,834 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-02-10 23:44:16,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-02-10 23:44:16,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:16,920 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-02-10 23:44:17,001 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-02-10 23:44:17,001 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-02-10 23:44:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:17,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:17,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:17,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:18,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877354948] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:18,063 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:18,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:44:18,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787567323] [2022-02-10 23:44:18,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:18,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:44:18,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:44:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:44:18,064 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-02-10 23:44:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:21,314 INFO L93 Difference]: Finished difference Result 7625 states and 15041 transitions. [2022-02-10 23:44:21,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-10 23:44:21,314 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-02-10 23:44:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:21,323 INFO L225 Difference]: With dead ends: 7625 [2022-02-10 23:44:21,324 INFO L226 Difference]: Without dead ends: 7597 [2022-02-10 23:44:21,324 INFO L933 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-02-10 23:44:21,325 INFO L934 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-02-10 23:44:21,325 INFO L935 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-02-10 23:44:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2022-02-10 23:44:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 3312. [2022-02-10 23:44:21,375 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-02-10 23:44:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 6543 transitions. [2022-02-10 23:44:21,379 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 6543 transitions. Word has length 134 [2022-02-10 23:44:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:21,380 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 6543 transitions. [2022-02-10 23:44:21,380 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-02-10 23:44:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 6543 transitions. [2022-02-10 23:44:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:21,382 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:21,382 INFO L515 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-02-10 23:44:21,416 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-02-10 23:44:21,599 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-02-10 23:44:21,600 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-02-10 23:44:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash -839246923, now seen corresponding path program 1 times [2022-02-10 23:44:21,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:21,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281060754] [2022-02-10 23:44:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:22,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:22,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281060754] [2022-02-10 23:44:22,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281060754] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:22,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001151657] [2022-02-10 23:44:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:22,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:22,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:22,045 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-02-10 23:44:22,046 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-02-10 23:44:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:22,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 23:44:22,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:23,013 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-02-10 23:44:23,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,051 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-02-10 23:44:23,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,090 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-02-10 23:44:23,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,142 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-02-10 23:44:23,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,243 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-02-10 23:44:23,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,268 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-02-10 23:44:23,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,295 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-02-10 23:44:23,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-10 23:44:23,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,461 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-02-10 23:44:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:29,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:30,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:30,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:31,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001151657] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:31,451 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:31,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-02-10 23:44:31,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074390720] [2022-02-10 23:44:31,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:31,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-10 23:44:31,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-10 23:44:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1739, Unknown=2, NotChecked=0, Total=1980 [2022-02-10 23:44:31,453 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-02-10 23:45:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:45:10,684 INFO L93 Difference]: Finished difference Result 9029 states and 17852 transitions. [2022-02-10 23:45:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 23:45:10,684 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-02-10 23:45:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:45:10,694 INFO L225 Difference]: With dead ends: 9029 [2022-02-10 23:45:10,694 INFO L226 Difference]: Without dead ends: 9017 [2022-02-10 23:45:10,696 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=1670, Invalid=8614, Unknown=18, NotChecked=0, Total=10302 [2022-02-10 23:45:10,696 INFO L934 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.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:45:10,696 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2878 Valid, 5121 Invalid, 5818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 4140 Invalid, 0 Unknown, 1332 Unchecked, 2.1s Time] [2022-02-10 23:45:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2022-02-10 23:45:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 3517. [2022-02-10 23:45:10,749 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-02-10 23:45:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 6955 transitions. [2022-02-10 23:45:10,753 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 6955 transitions. Word has length 134 [2022-02-10 23:45:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:45:10,753 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 6955 transitions. [2022-02-10 23:45:10,753 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-02-10 23:45:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 6955 transitions. [2022-02-10 23:45:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:45:10,756 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:45:10,756 INFO L515 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-02-10 23:45:10,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-02-10 23:45:10,957 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-02-10 23:45:10,957 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-02-10 23:45:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:45:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1180858669, now seen corresponding path program 1 times [2022-02-10 23:45:10,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:45:10,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459841252] [2022-02-10 23:45:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:45:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:45:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:45:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:11,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:45:11,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459841252] [2022-02-10 23:45:11,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459841252] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:45:11,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248900880] [2022-02-10 23:45:11,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:45:11,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:45:11,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:45:11,121 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-02-10 23:45:11,122 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-02-10 23:45:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:45:11,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-10 23:45:11,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:45:11,973 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-02-10 23:45:12,009 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-02-10 23:45:12,009 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-02-10 23:45:12,033 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-10 23:45:12,034 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-02-10 23:45:12,071 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-10 23:45:12,071 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-02-10 23:45:12,118 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-10 23:45:12,118 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-02-10 23:45:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:12,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:45:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:12,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248900880] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:45:12,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:45:12,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-02-10 23:45:12,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700412989] [2022-02-10 23:45:12,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:45:12,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 23:45:12,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:45:12,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 23:45:12,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 23:45:12,608 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-02-10 23:45:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:45:17,138 INFO L93 Difference]: Finished difference Result 7638 states and 15074 transitions. [2022-02-10 23:45:17,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-10 23:45:17,138 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-02-10 23:45:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:45:17,146 INFO L225 Difference]: With dead ends: 7638 [2022-02-10 23:45:17,146 INFO L226 Difference]: Without dead ends: 7610 [2022-02-10 23:45:17,147 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1853, Invalid=9919, Unknown=0, NotChecked=0, Total=11772 [2022-02-10 23:45:17,147 INFO L934 BasicCegarLoop]: 414 mSDtfsCounter, 2670 mSDsluCounter, 4644 mSDsCounter, 0 mSdLazyCounter, 5177 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:45:17,147 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2670 Valid, 5058 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5177 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-10 23:45:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-02-10 23:45:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 3445. [2022-02-10 23:45:17,185 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-02-10 23:45:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6784 transitions. [2022-02-10 23:45:17,189 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6784 transitions. Word has length 134 [2022-02-10 23:45:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:45:17,189 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 6784 transitions. [2022-02-10 23:45:17,189 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-02-10 23:45:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6784 transitions. [2022-02-10 23:45:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:45:17,191 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:45:17,191 INFO L515 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-02-10 23:45:17,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-02-10 23:45:17,392 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-02-10 23:45:17,392 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-02-10 23:45:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:45:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1411337857, now seen corresponding path program 3 times [2022-02-10 23:45:17,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:45:17,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476570956] [2022-02-10 23:45:17,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:45:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:45:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:45:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:17,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:45:17,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476570956] [2022-02-10 23:45:17,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476570956] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:45:17,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310508165] [2022-02-10 23:45:17,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:45:17,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:45:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:45:17,605 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-02-10 23:45:17,605 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-02-10 23:45:17,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 23:45:17,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:45:17,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-10 23:45:17,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:45:18,597 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-02-10 23:45:18,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,637 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-02-10 23:45:18,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,681 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-02-10 23:45:18,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,741 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-02-10 23:45:18,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:18,890 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-02-10 23:45:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:18,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:45:19,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) is different from false [2022-02-10 23:45:20,492 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-02-10 23:45:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-10 23:45:38,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310508165] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:45:38,524 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:45:38,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:45:38,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240497485] [2022-02-10 23:45:38,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:45:38,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:45:38,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:45:38,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:45:38,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1285, Unknown=19, NotChecked=150, Total=1640 [2022-02-10 23:45:38,525 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-02-10 23:45:42,013 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-10 23:45:42,621 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-10 23:45:47,109 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-10 23:45:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:45:49,596 INFO L93 Difference]: Finished difference Result 11852 states and 23499 transitions. [2022-02-10 23:45:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-10 23:45:49,596 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-02-10 23:45:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:45:49,610 INFO L225 Difference]: With dead ends: 11852 [2022-02-10 23:45:49,611 INFO L226 Difference]: Without dead ends: 11849 [2022-02-10 23:45:49,612 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=1502, Invalid=7231, Unknown=29, NotChecked=940, Total=9702 [2022-02-10 23:45:49,612 INFO L934 BasicCegarLoop]: 401 mSDtfsCounter, 2421 mSDsluCounter, 5388 mSDsCounter, 0 mSdLazyCounter, 3853 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 5787 SdHoareTripleChecker+Invalid, 5649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 3853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1636 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:45:49,612 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2421 Valid, 5787 Invalid, 5649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 3853 Invalid, 0 Unknown, 1636 Unchecked, 1.8s Time] [2022-02-10 23:45:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2022-02-10 23:45:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 3467. [2022-02-10 23:45:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3467 states, 3460 states have (on average 1.9734104046242775) internal successors, (6828), 3466 states have internal predecessors, (6828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:45:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 6828 transitions. [2022-02-10 23:45:49,688 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 6828 transitions. Word has length 134 [2022-02-10 23:45:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:45:49,688 INFO L470 AbstractCegarLoop]: Abstraction has 3467 states and 6828 transitions. [2022-02-10 23:45:49,688 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-02-10 23:45:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 6828 transitions. [2022-02-10 23:45:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:45:49,691 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:45:49,691 INFO L515 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-02-10 23:45:49,710 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-02-10 23:45:49,891 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-02-10 23:45:49,891 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-02-10 23:45:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:45:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1408959273, now seen corresponding path program 4 times [2022-02-10 23:45:49,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:45:49,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733072944] [2022-02-10 23:45:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:45:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:45:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:45:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:50,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:45:50,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733072944] [2022-02-10 23:45:50,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733072944] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:45:50,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434186488] [2022-02-10 23:45:50,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:45:50,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:45:50,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:45:50,134 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-02-10 23:45:50,137 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-02-10 23:45:50,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:45:50,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:45:50,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-02-10 23:45:50,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:45:51,208 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-02-10 23:45:51,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,240 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-02-10 23:45:51,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,278 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-02-10 23:45:51,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,358 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-02-10 23:45:51,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:45:51,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:45:51,463 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-02-10 23:45:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:45:51,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:45:52,516 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-02-10 23:45:53,310 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)) (= |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 (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|) .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 (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 .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| (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) |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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-02-10 23:46:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-10 23:46:04,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434186488] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:46:04,003 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:46:04,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2022-02-10 23:46:04,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315642456] [2022-02-10 23:46:04,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:46:04,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-10 23:46:04,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:46:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-10 23:46:04,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1381, Unknown=7, NotChecked=154, Total=1722 [2022-02-10 23:46:04,005 INFO L87 Difference]: Start difference. First operand 3467 states and 6828 transitions. Second operand has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:46:12,839 WARN L228 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 75 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:46:13,610 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-02-10 23:46:15,845 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-02-10 23:46:16,651 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-02-10 23:46:17,524 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-02-10 23:46:25,546 WARN L228 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:46:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:46:26,080 INFO L93 Difference]: Finished difference Result 13756 states and 27296 transitions. [2022-02-10 23:46:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-02-10 23:46:26,080 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-02-10 23:46:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:46:26,100 INFO L225 Difference]: With dead ends: 13756 [2022-02-10 23:46:26,100 INFO L226 Difference]: Without dead ends: 13756 [2022-02-10 23:46:26,101 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 246 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4314 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=1591, Invalid=10194, Unknown=11, NotChecked=1314, Total=13110 [2022-02-10 23:46:26,102 INFO L934 BasicCegarLoop]: 361 mSDtfsCounter, 2092 mSDsluCounter, 5984 mSDsCounter, 0 mSdLazyCounter, 3720 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 6344 SdHoareTripleChecker+Invalid, 6081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2260 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:46:26,102 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2092 Valid, 6344 Invalid, 6081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3720 Invalid, 0 Unknown, 2260 Unchecked, 1.8s Time] [2022-02-10 23:46:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13756 states. [2022-02-10 23:46:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13756 to 3481. [2022-02-10 23:46:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 3474 states have (on average 1.973517559009787) internal successors, (6856), 3480 states have internal predecessors, (6856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:46:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 6856 transitions. [2022-02-10 23:46:26,185 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 6856 transitions. Word has length 134 [2022-02-10 23:46:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:46:26,186 INFO L470 AbstractCegarLoop]: Abstraction has 3481 states and 6856 transitions. [2022-02-10 23:46:26,186 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-02-10 23:46:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 6856 transitions. [2022-02-10 23:46:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:46:26,188 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:46:26,189 INFO L515 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-02-10 23:46:26,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-02-10 23:46:26,389 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-02-10 23:46:26,389 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-02-10 23:46:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:46:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2011124973, now seen corresponding path program 5 times [2022-02-10 23:46:26,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:46:26,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963398340] [2022-02-10 23:46:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:46:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:46:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:46:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:46:26,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:46:26,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963398340] [2022-02-10 23:46:26,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963398340] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:46:26,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868237711] [2022-02-10 23:46:26,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:46:26,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:46:26,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:46:26,617 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-02-10 23:46:26,618 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-02-10 23:46:27,062 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:46:27,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:46:27,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-10 23:46:27,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:46:27,618 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-02-10 23:46:27,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:27,653 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-02-10 23:46:27,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:27,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:27,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:27,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-10 23:46:27,833 INFO L353 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2022-02-10 23:46:27,834 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-02-10 23:46:27,882 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-10 23:46:27,882 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-02-10 23:46:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:46:27,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:46:28,680 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-02-10 23:46:29,434 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-02-10 23:46:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-10 23:46:34,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868237711] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:46:34,807 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:46:34,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-02-10 23:46:34,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801890395] [2022-02-10 23:46:34,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:46:34,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 23:46:34,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:46:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 23:46:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1244, Unknown=5, NotChecked=146, Total=1560 [2022-02-10 23:46:34,809 INFO L87 Difference]: Start difference. First operand 3481 states and 6856 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-02-10 23:46:36,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |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))))))) (<= (div (+ .cse5 |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| .cse5) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-02-10 23:46:37,317 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-02-10 23:46:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:46:38,816 INFO L93 Difference]: Finished difference Result 9802 states and 19396 transitions. [2022-02-10 23:46:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-10 23:46:38,816 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-02-10 23:46:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:46:38,828 INFO L225 Difference]: With dead ends: 9802 [2022-02-10 23:46:38,829 INFO L226 Difference]: Without dead ends: 9796 [2022-02-10 23:46:38,830 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=857, Invalid=4554, Unknown=7, NotChecked=588, Total=6006 [2022-02-10 23:46:38,830 INFO L934 BasicCegarLoop]: 340 mSDtfsCounter, 1998 mSDsluCounter, 4801 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 4435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1272 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:46:38,830 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1998 Valid, 5139 Invalid, 4435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 3021 Invalid, 0 Unknown, 1272 Unchecked, 1.5s Time] [2022-02-10 23:46:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2022-02-10 23:46:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 3506. [2022-02-10 23:46:38,900 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-02-10 23:46:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 6906 transitions. [2022-02-10 23:46:38,904 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 6906 transitions. Word has length 134 [2022-02-10 23:46:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:46:38,904 INFO L470 AbstractCegarLoop]: Abstraction has 3506 states and 6906 transitions. [2022-02-10 23:46:38,904 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-02-10 23:46:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 6906 transitions. [2022-02-10 23:46:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:46:38,907 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:46:38,907 INFO L515 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-02-10 23:46:38,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-02-10 23:46:39,108 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-02-10 23:46:39,109 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-02-10 23:46:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:46:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash -467560269, now seen corresponding path program 6 times [2022-02-10 23:46:39,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:46:39,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383792528] [2022-02-10 23:46:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:46:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:46:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:46:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:46:39,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:46:39,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383792528] [2022-02-10 23:46:39,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383792528] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:46:39,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716124091] [2022-02-10 23:46:39,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:46:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:46:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:46:39,357 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-02-10 23:46:39,358 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-02-10 23:46:39,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 23:46:39,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:46:39,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-10 23:46:39,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:46:40,435 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-02-10 23:46:40,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,478 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-02-10 23:46:40,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-02-10 23:46:40,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,618 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-02-10 23:46:40,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:46:40,731 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-02-10 23:46:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:46:40,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:46:41,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) is different from false [2022-02-10 23:46:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-10 23:46:49,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716124091] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:46:49,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:46:49,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:46:49,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79460792] [2022-02-10 23:46:49,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:46:49,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:46:49,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:46:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:46:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1386, Unknown=10, NotChecked=76, Total=1640 [2022-02-10 23:46:49,702 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-02-10 23:46:51,865 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-02-10 23:46:55,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |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-02-10 23:46:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:46:59,296 INFO L93 Difference]: Finished difference Result 12916 states and 25623 transitions. [2022-02-10 23:46:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-02-10 23:46:59,296 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-02-10 23:46:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:46:59,315 INFO L225 Difference]: With dead ends: 12916 [2022-02-10 23:46:59,316 INFO L226 Difference]: Without dead ends: 12898 [2022-02-10 23:46:59,317 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5442 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=2555, Invalid=14214, Unknown=13, NotChecked=774, Total=17556 [2022-02-10 23:46:59,317 INFO L934 BasicCegarLoop]: 436 mSDtfsCounter, 2388 mSDsluCounter, 7719 mSDsCounter, 0 mSdLazyCounter, 6940 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 8153 SdHoareTripleChecker+Invalid, 8536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 6940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1392 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:46:59,317 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2388 Valid, 8153 Invalid, 8536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 6940 Invalid, 0 Unknown, 1392 Unchecked, 3.7s Time] [2022-02-10 23:46:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12898 states. [2022-02-10 23:46:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12898 to 3544. [2022-02-10 23:46:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 3537 states have (on average 1.9739892564320045) internal successors, (6982), 3543 states have internal predecessors, (6982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:46:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 6982 transitions. [2022-02-10 23:46:59,412 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 6982 transitions. Word has length 134 [2022-02-10 23:46:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:46:59,412 INFO L470 AbstractCegarLoop]: Abstraction has 3544 states and 6982 transitions. [2022-02-10 23:46:59,412 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-02-10 23:46:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 6982 transitions. [2022-02-10 23:46:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:46:59,415 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:46:59,415 INFO L515 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-02-10 23:46:59,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-02-10 23:46:59,615 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-02-10 23:46:59,615 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-02-10 23:46:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:46:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 416790693, now seen corresponding path program 7 times [2022-02-10 23:46:59,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:46:59,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537785560] [2022-02-10 23:46:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:46:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:46:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:46:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:46:59,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:46:59,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537785560] [2022-02-10 23:46:59,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537785560] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:46:59,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771502293] [2022-02-10 23:46:59,858 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:46:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:46:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:46:59,860 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-02-10 23:46:59,861 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-02-10 23:47:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:47:00,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-10 23:47:00,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:47:00,891 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-02-10 23:47:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:00,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-10 23:47:01,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,025 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-02-10 23:47:01,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,083 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-02-10 23:47:01,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:01,196 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-02-10 23:47:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:01,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:47:03,084 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-02-10 23:47:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-10 23:47:03,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771502293] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:47:03,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:47:03,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:47:03,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437444724] [2022-02-10 23:47:03,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:47:03,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:47:03,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:47:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:47:03,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1385, Unknown=1, NotChecked=76, Total=1640 [2022-02-10 23:47:03,520 INFO L87 Difference]: Start difference. First operand 3544 states and 6982 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-02-10 23:47:05,494 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-02-10 23:47:08,386 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-02-10 23:47:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:47:10,781 INFO L93 Difference]: Finished difference Result 12595 states and 24983 transitions. [2022-02-10 23:47:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-02-10 23:47:10,781 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-02-10 23:47:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:47:10,798 INFO L225 Difference]: With dead ends: 12595 [2022-02-10 23:47:10,798 INFO L226 Difference]: Without dead ends: 12571 [2022-02-10 23:47:10,799 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1995, Invalid=10670, Unknown=3, NotChecked=672, Total=13340 [2022-02-10 23:47:10,799 INFO L934 BasicCegarLoop]: 395 mSDtfsCounter, 2529 mSDsluCounter, 6095 mSDsCounter, 0 mSdLazyCounter, 5449 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 6489 SdHoareTripleChecker+Invalid, 7753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 5449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2107 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:47:10,800 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2529 Valid, 6489 Invalid, 7753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 5449 Invalid, 0 Unknown, 2107 Unchecked, 2.6s Time] [2022-02-10 23:47:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12571 states. [2022-02-10 23:47:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12571 to 3574. [2022-02-10 23:47:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 3567 states have (on average 1.9742080179422483) internal successors, (7042), 3573 states have internal predecessors, (7042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:47:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 7042 transitions. [2022-02-10 23:47:10,875 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 7042 transitions. Word has length 134 [2022-02-10 23:47:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:47:10,875 INFO L470 AbstractCegarLoop]: Abstraction has 3574 states and 7042 transitions. [2022-02-10 23:47:10,875 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-02-10 23:47:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 7042 transitions. [2022-02-10 23:47:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:47:10,877 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:47:10,877 INFO L515 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-02-10 23:47:10,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-02-10 23:47:11,078 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-02-10 23:47:11,078 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-02-10 23:47:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:47:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1462386007, now seen corresponding path program 2 times [2022-02-10 23:47:11,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:47:11,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181039581] [2022-02-10 23:47:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:47:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:47:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:47:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:11,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:47:11,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181039581] [2022-02-10 23:47:11,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181039581] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:47:11,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112365831] [2022-02-10 23:47:11,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:47:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:47:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:47:11,452 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-02-10 23:47:11,452 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-02-10 23:47:11,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:47:11,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:47:11,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-10 23:47:11,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:47:12,289 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-02-10 23:47:12,350 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-02-10 23:47:12,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,393 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-02-10 23:47:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-10 23:47:12,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,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, 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-02-10 23:47:12,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,633 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-02-10 23:47:12,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,720 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-02-10 23:47:12,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,745 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-02-10 23:47:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,773 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-02-10 23:47:12,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:12,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 48 treesize of output 56 [2022-02-10 23:47:12,911 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-02-10 23:47:12,911 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-02-10 23:47:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:12,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:47:23,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:23,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:47:23,317 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-02-10 23:47:23,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:23,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:47:23,324 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-02-10 23:47:23,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:23,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:23,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:47:23,337 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-02-10 23:47:23,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:23,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:47:23,343 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-02-10 23:47:23,353 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-02-10 23:47:23,358 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-02-10 23:47:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:23,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112365831] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:47:23,775 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:47:23,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 46 [2022-02-10 23:47:23,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209258718] [2022-02-10 23:47:23,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:47:23,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-10 23:47:23,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:47:23,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-10 23:47:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1912, Unknown=4, NotChecked=0, Total=2162 [2022-02-10 23:47:23,776 INFO L87 Difference]: Start difference. First operand 3574 states and 7042 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-02-10 23:47:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:47:29,061 INFO L93 Difference]: Finished difference Result 8917 states and 17642 transitions. [2022-02-10 23:47:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-10 23:47:29,062 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-02-10 23:47:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:47:29,072 INFO L225 Difference]: With dead ends: 8917 [2022-02-10 23:47:29,072 INFO L226 Difference]: Without dead ends: 8917 [2022-02-10 23:47:29,073 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 260 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3247 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1715, Invalid=8583, Unknown=4, NotChecked=0, Total=10302 [2022-02-10 23:47:29,073 INFO L934 BasicCegarLoop]: 381 mSDtfsCounter, 2474 mSDsluCounter, 6202 mSDsCounter, 0 mSdLazyCounter, 3986 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 6582 SdHoareTripleChecker+Invalid, 6546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 3986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2339 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:47:29,073 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2474 Valid, 6582 Invalid, 6546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 3986 Invalid, 0 Unknown, 2339 Unchecked, 2.2s Time] [2022-02-10 23:47:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8917 states. [2022-02-10 23:47:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8917 to 3612. [2022-02-10 23:47:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3612 states, 3605 states have (on average 1.9744798890429958) internal successors, (7118), 3611 states have internal predecessors, (7118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:47:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 7118 transitions. [2022-02-10 23:47:29,133 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 7118 transitions. Word has length 134 [2022-02-10 23:47:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:47:29,134 INFO L470 AbstractCegarLoop]: Abstraction has 3612 states and 7118 transitions. [2022-02-10 23:47:29,134 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-02-10 23:47:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 7118 transitions. [2022-02-10 23:47:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:47:29,136 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:47:29,136 INFO L515 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-02-10 23:47:29,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-02-10 23:47:29,336 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-02-10 23:47:29,336 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-02-10 23:47:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:47:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash -165019217, now seen corresponding path program 3 times [2022-02-10 23:47:29,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:47:29,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569855597] [2022-02-10 23:47:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:47:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:47:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:47:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:29,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:47:29,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569855597] [2022-02-10 23:47:29,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569855597] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:47:29,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688815439] [2022-02-10 23:47:29,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:47:29,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:47:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:47:29,721 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-02-10 23:47:29,721 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-02-10 23:47:30,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 23:47:30,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:47:30,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-10 23:47:30,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:47:30,778 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-02-10 23:47:30,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,819 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-02-10 23:47:30,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,864 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-02-10 23:47:30,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:30,959 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-02-10 23:47:31,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,070 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-02-10 23:47:31,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,101 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-02-10 23:47:31,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,129 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-02-10 23:47:31,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,161 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-02-10 23:47:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:47:31,264 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-02-10 23:47:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:31,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:47:41,545 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-02-10 23:47:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:47:52,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688815439] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:47:52,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:47:52,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 42 [2022-02-10 23:47:52,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14709832] [2022-02-10 23:47:52,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:47:52,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-10 23:47:52,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:47:52,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-10 23:47:52,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1531, Unknown=12, NotChecked=80, Total=1806 [2022-02-10 23:47:52,640 INFO L87 Difference]: Start difference. First operand 3612 states and 7118 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-02-10 23:47:56,326 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-02-10 23:47:59,646 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-02-10 23:48:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:48:01,045 INFO L93 Difference]: Finished difference Result 17303 states and 34457 transitions. [2022-02-10 23:48:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-02-10 23:48:01,046 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-02-10 23:48:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:48:01,071 INFO L225 Difference]: With dead ends: 17303 [2022-02-10 23:48:01,071 INFO L226 Difference]: Without dead ends: 17303 [2022-02-10 23:48:01,072 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=1471, Invalid=8229, Unknown=14, NotChecked=588, Total=10302 [2022-02-10 23:48:01,072 INFO L934 BasicCegarLoop]: 384 mSDtfsCounter, 2309 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 5252 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 7833 SdHoareTripleChecker+Invalid, 6967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 5252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1548 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:48:01,072 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2309 Valid, 7833 Invalid, 6967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 5252 Invalid, 0 Unknown, 1548 Unchecked, 2.7s Time] [2022-02-10 23:48:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17303 states. [2022-02-10 23:48:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17303 to 3619. [2022-02-10 23:48:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3619 states, 3612 states have (on average 1.97452934662237) internal successors, (7132), 3618 states have internal predecessors, (7132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:48:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 7132 transitions. [2022-02-10 23:48:01,180 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 7132 transitions. Word has length 134 [2022-02-10 23:48:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:48:01,180 INFO L470 AbstractCegarLoop]: Abstraction has 3619 states and 7132 transitions. [2022-02-10 23:48:01,180 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-02-10 23:48:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 7132 transitions. [2022-02-10 23:48:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:48:01,183 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:48:01,183 INFO L515 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-02-10 23:48:01,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-02-10 23:48:01,395 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-02-10 23:48:01,395 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-02-10 23:48:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:48:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1815145099, now seen corresponding path program 4 times [2022-02-10 23:48:01,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:48:01,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983003817] [2022-02-10 23:48:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:48:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:48:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:48:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:48:01,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:48:01,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983003817] [2022-02-10 23:48:01,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983003817] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:48:01,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597795936] [2022-02-10 23:48:01,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:48:01,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:48:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:48:01,812 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-02-10 23:48:01,813 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-02-10 23:48:02,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:48:02,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:48:02,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 23:48:02,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:48:02,775 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-02-10 23:48:02,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,814 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-02-10 23:48:02,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,859 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-02-10 23:48:02,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:02,971 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-02-10 23:48:03,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,063 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-02-10 23:48:03,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,093 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-02-10 23:48:03,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,143 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-02-10 23:48:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,166 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-02-10 23:48:03,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:48:03,262 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:48:03,262 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-02-10 23:48:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:48:03,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:48:05,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int)) (or (and (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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) 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|)))) is different from false [2022-02-10 23:48:07,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int)) (or (and (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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) (+ |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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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) 0) .cse5 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |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_94|)))) is different from false [2022-02-10 23:48:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-10 23:48:15,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597795936] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:48:15,541 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:48:15,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 42 [2022-02-10 23:48:15,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575210464] [2022-02-10 23:48:15,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:48:15,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-10 23:48:15,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:48:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-10 23:48:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1456, Unknown=6, NotChecked=158, Total=1806 [2022-02-10 23:48:15,542 INFO L87 Difference]: Start difference. First operand 3619 states and 7132 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-02-10 23:49:22,154 WARN L228 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 77 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:49:24,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse1 (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) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 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)) (<= 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) (= (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= 0 (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int)) (or (and (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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) 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) .cse6 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|)))))) is different from false [2022-02-10 23:49:29,229 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_~#cache~0.offset| 0) (= (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))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int)) (or (and (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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) 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |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_94|)))))) is different from false [2022-02-10 23:49:31,727 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)) (<= 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) (= (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))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int)) (or (and (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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) 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 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_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_6597 Int) (v_ArrVal_6595 Int)) (= (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| 3) v_ArrVal_6595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| v_ArrVal_6597))) |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_94|)))))) is different from false [2022-02-10 23:49:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:49:33,620 INFO L93 Difference]: Finished difference Result 17704 states and 35254 transitions. [2022-02-10 23:49:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-02-10 23:49:33,623 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-02-10 23:49:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:49:33,646 INFO L225 Difference]: With dead ends: 17704 [2022-02-10 23:49:33,646 INFO L226 Difference]: Without dead ends: 17692 [2022-02-10 23:49:33,646 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 262 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 5952 ImplicationChecksByTransitivity, 86.5s TimeCoverageRelationStatistics Valid=2274, Invalid=13487, Unknown=9, NotChecked=1260, Total=17030 [2022-02-10 23:49:33,647 INFO L934 BasicCegarLoop]: 414 mSDtfsCounter, 3101 mSDsluCounter, 6798 mSDsCounter, 0 mSdLazyCounter, 5413 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 7211 SdHoareTripleChecker+Invalid, 8186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 5413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2468 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:49:33,647 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3101 Valid, 7211 Invalid, 8186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 5413 Invalid, 0 Unknown, 2468 Unchecked, 3.2s Time] [2022-02-10 23:49:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17692 states. [2022-02-10 23:49:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17692 to 3801. [2022-02-10 23:49:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3801 states, 3794 states have (on average 1.9757511860832895) internal successors, (7496), 3800 states have internal predecessors, (7496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:49:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 7496 transitions. [2022-02-10 23:49:33,735 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 7496 transitions. Word has length 134 [2022-02-10 23:49:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:49:33,735 INFO L470 AbstractCegarLoop]: Abstraction has 3801 states and 7496 transitions. [2022-02-10 23:49:33,735 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-02-10 23:49:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 7496 transitions. [2022-02-10 23:49:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:49:33,737 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:49:33,737 INFO L515 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-02-10 23:49:33,755 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-02-10 23:49:33,939 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-02-10 23:49:33,939 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:49:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:49:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash 768196573, now seen corresponding path program 5 times [2022-02-10 23:49:33,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:49:33,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265904529] [2022-02-10 23:49:33,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:49:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:49:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:49:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:49:34,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:49:34,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265904529] [2022-02-10 23:49:34,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265904529] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:49:34,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122505558] [2022-02-10 23:49:34,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:49:34,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:49:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:49:34,347 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:49:34,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-02-10 23:49:34,752 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:49:34,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:49:34,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-10 23:49:34,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:49:35,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 11 treesize of output 7 [2022-02-10 23:49:35,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,350 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-02-10 23:49:35,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,434 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-02-10 23:49:35,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,482 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-02-10 23:49:35,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,596 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-02-10 23:49:35,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,620 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-02-10 23:49:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,667 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-02-10 23:49:35,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:35,694 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-02-10 23:49:35,806 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-02-10 23:49:35,807 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-02-10 23:49:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:49:35,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:49:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:49:57,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122505558] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:49:57,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:49:57,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 42 [2022-02-10 23:49:57,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768223899] [2022-02-10 23:49:57,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:49:57,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-10 23:49:57,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:49:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-10 23:49:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1606, Unknown=10, NotChecked=0, Total=1806 [2022-02-10 23:49:57,058 INFO L87 Difference]: Start difference. First operand 3801 states and 7496 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-02-10 23:50:08,435 WARN L228 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:50:14,286 WARN L228 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:50:29,788 WARN L228 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:50:47,390 WARN L228 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:50:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:50:55,225 INFO L93 Difference]: Finished difference Result 10092 states and 20019 transitions. [2022-02-10 23:50:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-10 23:50:55,226 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-02-10 23:50:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:50:55,238 INFO L225 Difference]: With dead ends: 10092 [2022-02-10 23:50:55,238 INFO L226 Difference]: Without dead ends: 10086 [2022-02-10 23:50:55,239 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 265 SyntacticMatches, 27 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5624 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=1928, Invalid=10486, Unknown=18, NotChecked=0, Total=12432 [2022-02-10 23:50:55,239 INFO L934 BasicCegarLoop]: 382 mSDtfsCounter, 2897 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 3278 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 4719 SdHoareTripleChecker+Invalid, 4323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 3278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 885 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:50:55,239 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2897 Valid, 4719 Invalid, 4323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 3278 Invalid, 0 Unknown, 885 Unchecked, 2.2s Time] [2022-02-10 23:50:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10086 states. [2022-02-10 23:50:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10086 to 3837. [2022-02-10 23:50:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3830 states have (on average 1.9759791122715404) internal successors, (7568), 3836 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:50:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 7568 transitions. [2022-02-10 23:50:55,311 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 7568 transitions. Word has length 134 [2022-02-10 23:50:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:50:55,311 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 7568 transitions. [2022-02-10 23:50:55,311 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-02-10 23:50:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 7568 transitions. [2022-02-10 23:50:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:50:55,314 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:50:55,314 INFO L515 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-02-10 23:50:55,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-02-10 23:50:55,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:50:55,514 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:50:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:50:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1782860119, now seen corresponding path program 6 times [2022-02-10 23:50:55,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:50:55,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854144973] [2022-02-10 23:50:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:50:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:50:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:50:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:50:56,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:50:56,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854144973] [2022-02-10 23:50:56,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854144973] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:50:56,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753601230] [2022-02-10 23:50:56,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:50:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:50:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:50:56,049 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:50:56,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-02-10 23:50:56,455 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 23:50:56,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:50:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-10 23:50:56,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:50:57,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 11 treesize of output 7 [2022-02-10 23:50:57,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-10 23:50:57,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,576 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 28 treesize of output 30 [2022-02-10 23:50:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,595 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-02-10 23:50:57,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,623 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-02-10 23:50:57,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,639 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-02-10 23:50:57,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,662 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-02-10 23:50:57,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,730 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-02-10 23:50:57,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:50:57,893 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-02-10 23:50:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:50:57,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:51:34,241 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-10 23:51:34,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-02-10 23:51:34,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:51:34,444 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) 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:611) 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:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:308) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-02-10 23:51:34,447 INFO L158 Benchmark]: Toolchain (without parser) took 525784.72ms. Allocated memory was 221.2MB in the beginning and 992.0MB in the end (delta: 770.7MB). Free memory was 168.7MB in the beginning and 860.9MB in the end (delta: -692.3MB). Peak memory consumption was 618.3MB. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.20ms. Allocated memory is still 221.2MB. Free memory was 168.5MB in the beginning and 179.8MB in the end (delta: -11.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.51ms. Allocated memory is still 221.2MB. Free memory was 179.8MB in the beginning and 177.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 221.2MB. Free memory was 177.2MB in the beginning and 175.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 INFO L158 Benchmark]: RCFGBuilder took 370.84ms. Allocated memory is still 221.2MB. Free memory was 175.7MB in the beginning and 160.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 INFO L158 Benchmark]: TraceAbstraction took 524873.50ms. Allocated memory was 221.2MB in the beginning and 992.0MB in the end (delta: 770.7MB). Free memory was 159.9MB in the beginning and 860.9MB in the end (delta: -701.0MB). Peak memory consumption was 608.1MB. Max. memory is 8.0GB. [2022-02-10 23:51:34,447 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.09ms. Allocated memory is still 221.2MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.20ms. Allocated memory is still 221.2MB. Free memory was 168.5MB in the beginning and 179.8MB in the end (delta: -11.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.51ms. Allocated memory is still 221.2MB. Free memory was 179.8MB in the beginning and 177.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 221.2MB. Free memory was 177.2MB in the beginning and 175.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 370.84ms. Allocated memory is still 221.2MB. Free memory was 175.7MB in the beginning and 160.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 524873.50ms. Allocated memory was 221.2MB in the beginning and 992.0MB in the end (delta: 770.7MB). Free memory was 159.9MB in the beginning and 860.9MB in the end (delta: -701.0MB). Peak memory consumption was 608.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-10 23:51:34,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...